31,513,990
31,513,990 is a composite number, even.
31,513,990 (thirty-one million five hundred thirteen thousand nine hundred ninety) is an even 8-digit number. It is a composite number with 8 divisors, and factors as 2 × 5 × 3,151,399. Written other ways, in hexadecimal, 0x1E0DD86.
Interestingness
Properties
- Parity
- Even
- Digit count
- 8
- Digit sum
- 31
- Digit product
- 0
- Digital root
- 4
- Palindrome
- No
- Bit width
- 25 bits
- Reversed
- 9,931,513
- Square (n²)
- 993,131,565,720,100
- Divisor count
- 8
- σ(n) — sum of divisors
- 56,725,200
- φ(n) — Euler's totient
- 12,605,592
- Sum of prime factors
- 3,151,406
Primality
Prime factorization: 2 × 5 × 3151399
Nearest primes: 31,513,987 (−3) · 31,514,023 (+33)
Divisors & multiples
Sums & aliquot sequence
Continued fraction of √n
√31,513,990 = [5613; (1, 2, 1, 2, 1, 3, 2, 4, 5, 2, 1, 7, 1, 1, 1, 1, 6, 1, 3, 1, 2, 5, 1, 13, …)]
Representations
- In words
- thirty-one million five hundred thirteen thousand nine hundred ninety
- Ordinal
- 31513990th
- Binary
- 1111000001101110110000110
- Octal
- 170156606
- Hexadecimal
- 0x1E0DD86
- Base64
- AeDdhg==
- One's complement
- 4,263,453,305 (32-bit)
- Scientific notation
- 3.151399 × 10⁷
- As a duration
- 31,513,990 s = 364 days, 17 hours, 53 minutes, 10 seconds
As an angle
Historical numeral systems
- Chinese
- 三千一百五十一萬三千九百九十
- Chinese (financial)
- 參仟壹佰伍拾壹萬參仟玖佰玖拾
Also seen as
Goldbach's conjecture says every even integer greater than 2 is the sum of two primes. For 31513990, here are decompositions:
- 3 + 31513987 = 31513990
- 23 + 31513967 = 31513990
- 47 + 31513943 = 31513990
- 113 + 31513877 = 31513990
- 173 + 31513817 = 31513990
- 197 + 31513793 = 31513990
- 251 + 31513739 = 31513990
- 269 + 31513721 = 31513990
Showing the first eight; more decompositions exist.
As an unsigned 32-bit integer, this is the IPv4 address 1.224.221.134.
- Address
- 1.224.221.134
- Class
- public
- IPv4-mapped IPv6
- ::ffff:1.224.221.134
Public, routable address (assignable to a host on the internet).