Base | Representation |
---|---|
bin | 1001001100000001010101… |
… | …1001001101010111110101 |
3 | 1022202202100020210212200210 |
4 | 2103000111121031113311 |
5 | 2311003121213310401 |
6 | 33252503434100033 |
7 | 2061566000200212 |
oct | 223002531152765 |
9 | 38682306725623 |
10 | 10102122010101 |
11 | 3245316570780 |
12 | 1171a3827a619 |
13 | 58381a491134 |
14 | 26cd33d28b09 |
15 | 127ba55e14d6 |
hex | 9301564d5f5 |
10102122010101 has 64 divisors (see below), whose sum is σ = 15138072907776. Its totient is φ = 5941119744000.
The previous prime is 10102122010067. The next prime is 10102122010117. The reversal of 10102122010101 is 10101022120101.
It is not a de Polignac number, because 10102122010101 - 233 = 10093532075509 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102122010151) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 33148320 + ... + 33451686.
It is an arithmetic number, because the mean of its divisors is an integer number (236532389184).
Almost surely, 210102122010101 is an apocalyptic number.
10102122010101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10102122010101 is a deficient number, since it is larger than the sum of its proper divisors (5035950897675).
10102122010101 is a wasteful number, since it uses less digits than its factorization.
10102122010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303682.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10102122010101 its reverse (10101022120101), we get a palindrome (20203144130202).
It can be divided in two parts, 101021 and 22010101, that added together give a palindrome (22111122).
The spelling of 10102122010101 in words is "ten trillion, one hundred two billion, one hundred twenty-two million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •