Base | Representation |
---|---|
bin | 1001001011111101111010… |
… | …0011101001100010001011 |
3 | 1022202122222010122112010000 |
4 | 2102333132203221202023 |
5 | 2310444230203000021 |
6 | 33252232251054043 |
7 | 2061534126221103 |
oct | 222773643514213 |
9 | 38678863575100 |
10 | 10101202000011 |
11 | 3244994211561 |
12 | 1171820141323 |
13 | 5837019ac875 |
14 | 26cc87a80203 |
15 | 127b4e960b26 |
hex | 92fde8e988b |
10101202000011 has 20 divisors (see below), whose sum is σ = 15109868732200. Its totient is φ = 6725022130656.
The previous prime is 10101201999979. The next prime is 10101202000027. The reversal of 10101202000011 is 11000020210101.
It is a happy number.
It is not a de Polignac number, because 10101202000011 - 25 = 10101201999979 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10101201999957 and 10101202000002.
It is not an unprimeable number, because it can be changed into a prime (10101202000511) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 84315106 + ... + 84434823.
It is an arithmetic number, because the mean of its divisors is an integer number (755493436610).
Almost surely, 210101202000011 is an apocalyptic number.
10101202000011 is a deficient number, since it is larger than the sum of its proper divisors (5008666732189).
10101202000011 is an equidigital number, since it uses as much as digits as its factorization.
10101202000011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168750680 (or 168750671 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10101202000011 its reverse (11000020210101), we get a palindrome (21101222210112).
The spelling of 10101202000011 in words is "ten trillion, one hundred one billion, two hundred two million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •