Base | Representation |
---|---|
bin | 1011000110001001010111… |
… | …0110000100110010100001 |
3 | 1121012022220101101220010211 |
4 | 2301202111312010302201 |
5 | 3044342023100214332 |
6 | 41540412035054121 |
7 | 2366302565210332 |
oct | 261422566046241 |
9 | 47168811356124 |
10 | 12200221101217 |
11 | 39840a2830686 |
12 | 1450599441341 |
13 | 6a6625773786 |
14 | 3026cb1b6289 |
15 | 1625509bb447 |
hex | b1895d84ca1 |
12200221101217 has 2 divisors, whose sum is σ = 12200221101218. Its totient is φ = 12200221101216.
The previous prime is 12200221101181. The next prime is 12200221101221. The reversal of 12200221101217 is 71210112200221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12143942553856 + 56278547361 = 3484816^2 + 237231^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12200221101217 is a prime.
It is not a weakly prime, because it can be changed into another prime (12200221401217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100110550608 + 6100110550609.
It is an arithmetic number, because the mean of its divisors is an integer number (6100110550609).
Almost surely, 212200221101217 is an apocalyptic number.
It is an amenable number.
12200221101217 is a deficient number, since it is larger than the sum of its proper divisors (1).
12200221101217 is an equidigital number, since it uses as much as digits as its factorization.
12200221101217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 12200221101217 its reverse (71210112200221), we get a palindrome (83410333301438).
The spelling of 12200221101217 in words is "twelve trillion, two hundred billion, two hundred twenty-one million, one hundred one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •