Base | Representation |
---|---|
bin | 1001010010011011011010… |
… | …0111101100100011100001 |
3 | 1100011021110212002011012211 |
4 | 2110212312213230203201 |
5 | 2314304041441401032 |
6 | 33415230451322121 |
7 | 2102543602204516 |
oct | 224466647544341 |
9 | 40137425064184 |
10 | 10212201122017 |
11 | 3287a74335834 |
12 | 118b2395b0341 |
13 | 59101119a10b |
14 | 2743b782330d |
15 | 12a999614747 |
hex | 949b69ec8e1 |
10212201122017 has 2 divisors, whose sum is σ = 10212201122018. Its totient is φ = 10212201122016.
The previous prime is 10212201121987. The next prime is 10212201122029. The reversal of 10212201122017 is 71022110221201.
10212201122017 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8612117798881 + 1600083323136 = 2934641^2 + 1264944^2 .
It is a cyclic number.
It is not a de Polignac number, because 10212201122017 - 211 = 10212201119969 is a prime.
It is not a weakly prime, because it can be changed into another prime (10212201122917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106100561008 + 5106100561009.
It is an arithmetic number, because the mean of its divisors is an integer number (5106100561009).
Almost surely, 210212201122017 is an apocalyptic number.
It is an amenable number.
10212201122017 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212201122017 is an equidigital number, since it uses as much as digits as its factorization.
10212201122017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 10212201122017 its reverse (71022110221201), we get a palindrome (81234311343218).
The spelling of 10212201122017 in words is "ten trillion, two hundred twelve billion, two hundred one million, one hundred twenty-two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •