Base | Representation |
---|---|
bin | 10111001100010100110000… |
… | …111110111010100110001100 |
3 | 111101011021222202201121010110 |
4 | 113030110300332322212030 |
5 | 101332200044012041022 |
6 | 1000535023313040020 |
7 | 30325254436256550 |
oct | 2714246076724614 |
9 | 441137882647113 |
10 | 102002000112012 |
11 | 2a5568949707a0 |
12 | b534807556010 |
13 | 44bb993b93640 |
14 | 1b28ccd189860 |
15 | bbd48d18300c |
hex | 5cc530fba98c |
102002000112012 has 96 divisors (see below), whose sum is σ = 319558713675264. Its totient is φ = 24456024000000.
The previous prime is 102002000111987. The next prime is 102002000112013. The reversal of 102002000112012 is 210211000200201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (102002000112013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4245825489 + ... + 4245849512.
It is an arithmetic number, because the mean of its divisors is an integer number (3328736600784).
Almost surely, 2102002000112012 is an apocalyptic number.
102002000112012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102002000112012 is an abundant number, since it is smaller than the sum of its proper divisors (217556713563252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102002000112012 is a wasteful number, since it uses less digits than its factorization.
102002000112012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8491675039 (or 8491675037 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102002000112012 its reverse (210211000200201), we get a palindrome (312213000312213).
The spelling of 102002000112012 in words is "one hundred two trillion, two billion, one hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •