Base | Representation |
---|---|
bin | 10111001100011100010100… |
… | …011000011111011110101010 |
3 | 111101012001220222022100211110 |
4 | 113030130110120133132222 |
5 | 101332313201203241020 |
6 | 1000542444144411150 |
7 | 30325662425056140 |
oct | 2714342430373652 |
9 | 441161828270743 |
10 | 102010110212010 |
11 | 2a55a2768a8980 |
12 | b5362ab616ab6 |
13 | 44bc687175490 |
14 | 1b2945c313590 |
15 | bbd7b517a8e0 |
hex | 5cc71461f7aa |
102010110212010 has 512 divisors, whose sum is σ = 339001004998656. Its totient is φ = 18958510080000.
The previous prime is 102010110211993. The next prime is 102010110212051. The reversal of 102010110212010 is 10212011010201.
It is a Curzon number.
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, 267587035 + ... + 267967985.
It is an arithmetic number, because the mean of its divisors is an integer number (662111337888).
Almost surely, 2102010110212010 is an apocalyptic number.
102010110212010 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 102010110212010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (169500502499328).
102010110212010 is an abundant number, since it is smaller than the sum of its proper divisors (236990894786646).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102010110212010 is a wasteful number, since it uses less digits than its factorization.
102010110212010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 381270.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102010110212010 its reverse (10212011010201), we get a palindrome (112222121222211).
The spelling of 102010110212010 in words is "one hundred two trillion, ten billion, one hundred ten million, two hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •