Base | Representation |
---|---|
bin | 11101001000100110100… |
… | …101011100101110010000 |
3 | 21002101202221100011022111 |
4 | 131020212211130232100 |
5 | 230300301120023440 |
6 | 4131430352315104 |
7 | 264434646103636 |
oct | 35104645345620 |
9 | 7071687304274 |
10 | 2002102111120 |
11 | 7020a54a1001 |
12 | 28402bb42a94 |
13 | 116a49c110c7 |
14 | 6cc8bb29356 |
15 | 3712c8104ea |
hex | 1d22695cb90 |
2002102111120 has 40 divisors (see below), whose sum is σ = 4657552236864. Its totient is φ = 800382379392.
The previous prime is 2002102111103. The next prime is 2002102111147. The reversal of 2002102111120 is 211112012002.
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 2002102111120.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7022884 + ... + 7302403.
Almost surely, 22002102111120 is an apocalyptic number.
2002102111120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2002102111120 is an abundant number, since it is smaller than the sum of its proper divisors (2655450125744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002102111120 is a wasteful number, since it uses less digits than its factorization.
2002102111120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14327047 (or 14327041 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2002102111120 its reverse (211112012002), we get a palindrome (2213214123122).
The spelling of 2002102111120 in words is "two trillion, two billion, one hundred two million, one hundred eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •