Base | Representation |
---|---|
bin | 11101001000110011101… |
… | …000110101010010111100 |
3 | 21002102100012102001100021 |
4 | 131020303220311102330 |
5 | 230301223200231022 |
6 | 4131504214141524 |
7 | 264443245355230 |
oct | 35106350652274 |
9 | 7072305361307 |
10 | 2002321102012 |
11 | 7021a8075110 |
12 | 2840913518a4 |
13 | 116a833b740a |
14 | 6ccacc525c0 |
15 | 37141b6b7c7 |
hex | 1d233a354bc |
2002321102012 has 48 divisors (see below), whose sum is σ = 4625682985728. Its totient is φ = 734235390720.
The previous prime is 2002321101973. The next prime is 2002321102013. The reversal of 2002321102012 is 2102011232002.
It is a happy number.
It is a super-2 number, since 2×20023211020122 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002321102013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 191201898 + ... + 191212369.
It is an arithmetic number, because the mean of its divisors is an integer number (96368395536).
Almost surely, 22002321102012 is an apocalyptic number.
2002321102012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2002321102012 is an abundant number, since it is smaller than the sum of its proper divisors (2623361883716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002321102012 is a wasteful number, since it uses less digits than its factorization.
2002321102012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382414306 (or 382414304 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 2002321102012 its reverse (2102011232002), we get a palindrome (4104332334014).
The spelling of 2002321102012 in words is "two trillion, two billion, three hundred twenty-one million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •