Base | Representation |
---|---|
bin | 10010101001010011… |
… | …00101010000000001 |
3 | 221211121210211211021 |
4 | 21110221211100001 |
5 | 131000042334332 |
6 | 4333143345441 |
7 | 503026424605 |
oct | 112451452001 |
9 | 27747724737 |
10 | 10010121217 |
11 | 42774a8258 |
12 | 1b34452281 |
13 | c36b22265 |
14 | 6ad639505 |
15 | 3d8c0bc97 |
hex | 254a65401 |
10010121217 has 2 divisors, whose sum is σ = 10010121218. Its totient is φ = 10010121216.
The previous prime is 10010121193. The next prime is 10010121221. The reversal of 10010121217 is 71212101001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8714409201 + 1295712016 = 93351^2 + 35996^2 .
It is an emirp because it is prime and its reverse (71212101001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10010121217 - 27 = 10010121089 is a prime.
It is a super-2 number, since 2×100101212172 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10010121217.
It is not a weakly prime, because it can be changed into another prime (10010121227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005060608 + 5005060609.
It is an arithmetic number, because the mean of its divisors is an integer number (5005060609).
Almost surely, 210010121217 is an apocalyptic number.
It is an amenable number.
10010121217 is a deficient number, since it is larger than the sum of its proper divisors (1).
10010121217 is an equidigital number, since it uses as much as digits as its factorization.
10010121217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 10010121217 its reverse (71212101001), we get a palindrome (81222222218).
The spelling of 10010121217 in words is "ten billion, ten million, one hundred twenty-one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •