Base | Representation |
---|---|
bin | 1001010010010111101011… |
… | …1100110000011100010001 |
3 | 1100011011220002022101201000 |
4 | 2110211322330300130101 |
5 | 2314300014200310001 |
6 | 33414543250132213 |
7 | 2102510024662554 |
oct | 224457274603421 |
9 | 40134802271630 |
10 | 10211200010001 |
11 | 3287600222531 |
12 | 118abba281069 |
13 | 590bb1960a43 |
14 | 2743208a669b |
15 | 12a93b7b3a86 |
hex | 9497af30711 |
10211200010001 has 32 divisors (see below), whose sum is σ = 15170210029440. Its totient is φ = 6788365531200.
The previous prime is 10211200009993. The next prime is 10211200010009. The reversal of 10211200010001 is 10001000211201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10211200009993) and next prime (10211200010009).
It is not a de Polignac number, because 10211200010001 - 23 = 10211200009993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10211200010009) 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, 13425646 + ... + 14165816.
It is an arithmetic number, because the mean of its divisors is an integer number (474069063420).
Almost surely, 210211200010001 is an apocalyptic number.
It is an amenable number.
10211200010001 is a deficient number, since it is larger than the sum of its proper divisors (4959010019439).
10211200010001 is an equidigital number, since it uses as much as digits as its factorization.
10211200010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 741614 (or 741608 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10211200010001 its reverse (10001000211201), we get a palindrome (20212200221202).
The spelling of 10211200010001 in words is "ten trillion, two hundred eleven billion, two hundred million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •