Base | Representation |
---|---|
bin | 11101000110101111111… |
… | …110001111000011011111 |
3 | 21002012122020211010201211 |
4 | 131012233332033003133 |
5 | 230232212200320111 |
6 | 4130501104045251 |
7 | 264334433336434 |
oct | 35065776170337 |
9 | 7065566733654 |
10 | 2000112120031 |
11 | 701274170273 |
12 | 283775603827 |
13 | 1167c085c69c |
14 | 6cb3d717b8b |
15 | 37062c78521 |
hex | 1d1aff8f0df |
2000112120031 has 8 divisors (see below), whose sum is σ = 2105530958720. Its totient is φ = 1894708259352.
The previous prime is 2000112120011. The next prime is 2000112120043. The reversal of 2000112120031 is 1300212110002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2000112120031 - 237 = 1862673166559 is a prime.
It is a super-2 number, since 2×20001121200312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2000112119993 and 2000112120020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000112120001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3469875 + ... + 4005028.
It is an arithmetic number, because the mean of its divisors is an integer number (263191369840).
Almost surely, 22000112120031 is an apocalyptic number.
2000112120031 is a deficient number, since it is larger than the sum of its proper divisors (105418838689).
2000112120031 is a wasteful number, since it uses less digits than its factorization.
2000112120031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7489005.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 2000112120031 its reverse (1300212110002), we get a palindrome (3300324230033).
The spelling of 2000112120031 in words is "two trillion, one hundred twelve million, one hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •