Base | Representation |
---|---|
bin | 10111001100011110001011… |
… | …100101111000001111011010 |
3 | 111101012021002100122210022110 |
4 | 113030132023211320033122 |
5 | 101332331300203210020 |
6 | 1000543414431333150 |
7 | 30326063121552120 |
oct | 2714361345701732 |
9 | 441167070583273 |
10 | 102012110210010 |
11 | 2a560102843a90 |
12 | b5367693811b6 |
13 | 44bc91561b950 |
14 | 1b295abbab910 |
15 | bbd880a3c8e0 |
hex | 5cc78b9783da |
102012110210010 has 512 divisors, whose sum is σ = 337680925360128. Its totient is φ = 19033697157120.
The previous prime is 102012110209987. The next prime is 102012110210081. The reversal of 102012110210010 is 10012011210201.
It is an unprimeable number.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 7447763482 + ... + 7447777178.
It is an arithmetic number, because the mean of its divisors is an integer number (659533057344).
Almost surely, 2102012110210010 is an apocalyptic number.
102012110210010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 102012110210010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (168840462680064).
102012110210010 is an abundant number, since it is smaller than the sum of its proper divisors (235668815150118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102012110210010 is a wasteful number, since it uses less digits than its factorization.
102012110210010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20478.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102012110210010 its reverse (10012011210201), we get a palindrome (112024121420211).
The spelling of 102012110210010 in words is "one hundred two trillion, twelve billion, one hundred ten million, two hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •