Base | Representation |
---|---|
bin | 1001000110101010100111… |
… | …0001110010100001110001 |
3 | 1022102221212121221100111011 |
4 | 2101222221301302201301 |
5 | 2303001212240414301 |
6 | 33142330414550521 |
7 | 2052131105546053 |
oct | 221525161624161 |
9 | 38387777840434 |
10 | 10010122201201 |
11 | 320a2a6023661 |
12 | 1158041808441 |
13 | 577c482607a5 |
14 | 2686c75c18d3 |
15 | 1255bd8dda51 |
hex | 91aa9c72871 |
10010122201201 has 4 divisors (see below), whose sum is σ = 10020043036900. Its totient is φ = 10000201365504.
The previous prime is 10010122201187. The next prime is 10010122201243. The reversal of 10010122201201 is 10210222101001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3510676742400 + 6499445458801 = 1873680^2 + 2549401^2 .
It is a cyclic number.
It is not a de Polignac number, because 10010122201201 - 27 = 10010122201073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10010122207201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4960416336 + ... + 4960418353.
It is an arithmetic number, because the mean of its divisors is an integer number (2505010759225).
Almost surely, 210010122201201 is an apocalyptic number.
It is an amenable number.
10010122201201 is a deficient number, since it is larger than the sum of its proper divisors (9920835699).
10010122201201 is an equidigital number, since it uses as much as digits as its factorization.
10010122201201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9920835698.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10010122201201 its reverse (10210222101001), we get a palindrome (20220344302202).
The spelling of 10010122201201 in words is "ten trillion, ten billion, one hundred twenty-two million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •