Base | Representation |
---|---|
bin | 10110110010001100… |
… | …01001010000000001 |
3 | 1011120111001012112112 |
4 | 23121012021100001 |
5 | 200022420414332 |
6 | 5341442305105 |
7 | 612060665135 |
oct | 133106112001 |
9 | 34514035475 |
10 | 12232201217 |
11 | 5207838905 |
12 | 2454658195 |
13 | 11cc2b49b2 |
14 | 8407c33c5 |
15 | 4b8d3adb2 |
hex | 2d9189401 |
12232201217 has 2 divisors, whose sum is σ = 12232201218. Its totient is φ = 12232201216.
The previous prime is 12232201193. The next prime is 12232201243. The reversal of 12232201217 is 71210223221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10070323201 + 2161878016 = 100351^2 + 46496^2 .
It is an emirp because it is prime and its reverse (71210223221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12232201217 is a prime.
It is a super-2 number, since 2×122322012172 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12232201192 and 12232201201.
It is not a weakly prime, because it can be changed into another prime (12232201117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6116100608 + 6116100609.
It is an arithmetic number, because the mean of its divisors is an integer number (6116100609).
Almost surely, 212232201217 is an apocalyptic number.
It is an amenable number.
12232201217 is a deficient number, since it is larger than the sum of its proper divisors (1).
12232201217 is an equidigital number, since it uses as much as digits as its factorization.
12232201217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 672, while the sum is 23.
Adding to 12232201217 its reverse (71210223221), we get a palindrome (83442424438).
The spelling of 12232201217 in words is "twelve billion, two hundred thirty-two million, two hundred one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •