Base | Representation |
---|---|
bin | 1001001011111101111100… |
… | …0010001111100010100001 |
3 | 1022202122222200201222110200 |
4 | 2102333133002033202201 |
5 | 2310444234231120001 |
6 | 33252233135015413 |
7 | 2061534254333022 |
oct | 222773702174241 |
9 | 38678880658420 |
10 | 10101210020001 |
11 | 324499879a051 |
12 | 117182296a569 |
13 | 58370355a119 |
14 | 26cc88b6ac49 |
15 | 127b504e7086 |
hex | 92fdf08f8a1 |
10101210020001 has 12 divisors (see below), whose sum is σ = 14590839890640. Its totient is φ = 6734046231000.
The previous prime is 10101210019987. The next prime is 10101210020009. The reversal of 10101210020001 is 10002001210101.
It is a happy number.
It is not a de Polignac number, because 10101210020001 - 211 = 10101210017953 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10101210020009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7129875 + ... + 8428376.
It is an arithmetic number, because the mean of its divisors is an integer number (1215903324220).
Almost surely, 210101210020001 is an apocalyptic number.
It is an amenable number.
10101210020001 is a deficient number, since it is larger than the sum of its proper divisors (4489629870639).
10101210020001 is a wasteful number, since it uses less digits than its factorization.
10101210020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15630396 (or 15630393 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10101210020001 its reverse (10002001210101), we get a palindrome (20103211230102).
The spelling of 10101210020001 in words is "ten trillion, one hundred one billion, two hundred ten million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •