Base | Representation |
---|---|
bin | 1001000110110010101110… |
… | …1101110111100010000001 |
3 | 1022110011111120000100000021 |
4 | 2101230223231313202001 |
5 | 2303020143331224301 |
6 | 33143331012053441 |
7 | 2052236116410253 |
oct | 221545355674201 |
9 | 38404446010007 |
10 | 10012302211201 |
11 | 321021463a414 |
12 | 115854b904281 |
13 | 578204ab3434 |
14 | 268852d37cd3 |
15 | 125699eac8a1 |
hex | 91b2bb77881 |
10012302211201 has 8 divisors (see below), whose sum is σ = 10105378384640. Its totient is φ = 9919248223248.
The previous prime is 10012302211199. The next prime is 10012302211267. The reversal of 10012302211201 is 10211220321001.
10012302211201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10012302211201 - 21 = 10012302211199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10012302211271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4638891 + ... + 6445456.
It is an arithmetic number, because the mean of its divisors is an integer number (1263172298080).
Almost surely, 210012302211201 is an apocalyptic number.
It is an amenable number.
10012302211201 is a deficient number, since it is larger than the sum of its proper divisors (93076173439).
10012302211201 is a wasteful number, since it uses less digits than its factorization.
10012302211201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11092743.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 10012302211201 its reverse (10211220321001), we get a palindrome (20223522532202).
The spelling of 10012302211201 in words is "ten trillion, twelve billion, three hundred two million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •