Base | Representation |
---|---|
bin | 11101000110101011001… |
… | …001100011011101010110 |
3 | 21002012102121120000211202 |
4 | 131012223021203131112 |
5 | 230232030441413420 |
6 | 4130445053432502 |
7 | 264332431465265 |
oct | 35065311433526 |
9 | 7065377500752 |
10 | 2000031201110 |
11 | 701232521728 |
12 | 28375249b732 |
13 | 1167a9b69c77 |
14 | 6cb32a925dc |
15 | 3705aae2575 |
hex | 1d1ab263756 |
2000031201110 has 16 divisors (see below), whose sum is σ = 3600091583856. Its totient is φ = 800004608928.
The previous prime is 2000031201041. The next prime is 2000031201131. The reversal of 2000031201110 is 111021300002.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2000031201091 and 2000031201100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 144884 + ... + 2005256.
It is an arithmetic number, because the mean of its divisors is an integer number (225005723991).
Almost surely, 22000031201110 is an apocalyptic number.
2000031201110 is a deficient number, since it is larger than the sum of its proper divisors (1600060382746).
2000031201110 is a wasteful number, since it uses less digits than its factorization.
2000031201110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1967887.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 2000031201110 its reverse (111021300002), we get a palindrome (2111052501112).
The spelling of 2000031201110 in words is "two trillion, thirty-one million, two hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •