Base | Representation |
---|---|
bin | 1001001011111101001111… |
… | …0101110001010010110010 |
3 | 1022202122111121022210020202 |
4 | 2102333103311301102302 |
5 | 2310443343140413020 |
6 | 33252202345235202 |
7 | 2061526514030546 |
oct | 222772365612262 |
9 | 38678447283222 |
10 | 10101022201010 |
11 | 3244901776944 |
12 | 117178ba92b02 |
13 | 5836a3679320 |
14 | 26cc6bc39a26 |
15 | 127b3dc96e75 |
hex | 92fd3d714b2 |
10101022201010 has 64 divisors (see below), whose sum is σ = 20762860561632. Its totient is φ = 3505033998336.
The previous prime is 10101022201003. The next prime is 10101022201019. The reversal of 10101022201010 is 1010222010101.
It can be written as a sum of positive squares in 16 ways, for example, as 1649809233601 + 8451212967409 = 1284449^2 + 2907097^2 .
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10101022200982 and 10101022201000.
It is not an unprimeable number, because it can be changed into a prime (10101022201019) 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, 1879457 + ... + 4871796.
Almost surely, 210101022201010 is an apocalyptic number.
10101022201010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10101022201010 is an abundant number, since it is smaller than the sum of its proper divisors (10661838360622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101022201010 is a wasteful number, since it uses less digits than its factorization.
10101022201010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6751967.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10101022201010 its reverse (1010222010101), we get a palindrome (11111244211111).
The spelling of 10101022201010 in words is "ten trillion, one hundred one billion, twenty-two million, two hundred one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •