Base | Representation |
---|---|
bin | 1001001011111101001100… |
… | …1110111001010001110101 |
3 | 1022202122110220011000221200 |
4 | 2102333103032321101311 |
5 | 2310443333033310401 |
6 | 33252201343003113 |
7 | 2061526331304465 |
oct | 222772316712165 |
9 | 38678426130850 |
10 | 10101012010101 |
11 | 32448a6a46301 |
12 | 1171788599499 |
13 | 5836a151b8bc |
14 | 26cc6a745ba5 |
15 | 127b3ce32686 |
hex | 92fd33b9475 |
10101012010101 has 24 divisors (see below), whose sum is σ = 15095681028480. Its totient is φ = 6500846763936.
The previous prime is 10101012010091. The next prime is 10101012010147. The reversal of 10101012010101 is 10101021010101.
It is not a de Polignac number, because 10101012010101 - 27 = 10101012009973 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101012010171) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1055281 + ... + 4616886.
It is an arithmetic number, because the mean of its divisors is an integer number (628986709520).
Almost surely, 210101012010101 is an apocalyptic number.
It is an amenable number.
10101012010101 is a deficient number, since it is larger than the sum of its proper divisors (4994669018379).
10101012010101 is a wasteful number, since it uses less digits than its factorization.
10101012010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5679025 (or 5679022 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10101012010101 its reverse (10101021010101), we get a palindrome (20202033020202).
Subtracting 10101012010101 from its reverse (10101021010101), we obtain a square (9000000 = 30002).
The spelling of 10101012010101 in words is "ten trillion, one hundred one billion, twelve million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.283 sec. • engine limits •