Base | Representation |
---|---|
bin | 10001101000111101111… |
… | …101001010001011110011 |
3 | 11021212221201012121120122 |
4 | 101220331331022023303 |
5 | 124330111334021042 |
6 | 2324515234200455 |
7 | 153402642601016 |
oct | 21507575121363 |
9 | 4255851177518 |
10 | 1212220220147 |
11 | 428110791392 |
12 | 176b2a12312b |
13 | 8a4092661c1 |
14 | 429594ad37d |
15 | 217ec95b7d2 |
hex | 11a3df4a2f3 |
1212220220147 has 2 divisors, whose sum is σ = 1212220220148. Its totient is φ = 1212220220146.
The previous prime is 1212220220059. The next prime is 1212220220251. The reversal of 1212220220147 is 7410220222121.
It is a weak prime.
It is an emirp because it is prime and its reverse (7410220222121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1212220220147 - 226 = 1212153111283 is a prime.
It is a super-2 number, since 2×12122202201472 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1212220280147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606110110073 + 606110110074.
It is an arithmetic number, because the mean of its divisors is an integer number (606110110074).
Almost surely, 21212220220147 is an apocalyptic number.
1212220220147 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212220220147 is an equidigital number, since it uses as much as digits as its factorization.
1212220220147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1792, while the sum is 26.
Adding to 1212220220147 its reverse (7410220222121), we get a palindrome (8622440442268).
The spelling of 1212220220147 in words is "one trillion, two hundred twelve billion, two hundred twenty million, two hundred twenty thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •