Base | Representation |
---|---|
bin | 10110010111101101… |
… | …11001100111100001 |
3 | 1011000000010100121121 |
4 | 23023312321213201 |
5 | 144044041214332 |
6 | 5303430052241 |
7 | 603423114232 |
oct | 131366714741 |
9 | 34000110547 |
10 | 12010101217 |
11 | 5103430894 |
12 | 23b21aa081 |
13 | 119529048a |
14 | 81d0cb089 |
15 | 4a45b8797 |
hex | 2cbdb99e1 |
12010101217 has 2 divisors, whose sum is σ = 12010101218. Its totient is φ = 12010101216.
The previous prime is 12010101211. The next prime is 12010101223. The reversal of 12010101217 is 71210101021.
It is a balanced prime because it is at equal distance from previous prime (12010101211) and next prime (12010101223).
It can be written as a sum of positive squares in only one way, i.e., 9923347456 + 2086753761 = 99616^2 + 45681^2 .
It is an emirp because it is prime and its reverse (71210101021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12010101217 - 215 = 12010068449 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12010101217.
It is not a weakly prime, because it can be changed into another prime (12010101211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6005050608 + 6005050609.
It is an arithmetic number, because the mean of its divisors is an integer number (6005050609).
Almost surely, 212010101217 is an apocalyptic number.
It is an amenable number.
12010101217 is a deficient number, since it is larger than the sum of its proper divisors (1).
12010101217 is an equidigital number, since it uses as much as digits as its factorization.
12010101217 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 12010101217 its reverse (71210101021), we get a palindrome (83220202238).
The spelling of 12010101217 in words is "twelve billion, ten million, one hundred one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •