Base | Representation |
---|---|
bin | 10110101111110010… |
… | …01000001000011011 |
3 | 1011112002001110111222 |
4 | 23113321020020123 |
5 | 200002233332142 |
6 | 5335441442255 |
7 | 611424246131 |
oct | 132771101033 |
9 | 34462043458 |
10 | 12212011547 |
11 | 51a73a902a |
12 | 244994038b |
13 | 11c8066148 |
14 | 83bc49751 |
15 | 4b719dbd2 |
hex | 2d7e4821b |
12212011547 has 2 divisors, whose sum is σ = 12212011548. Its totient is φ = 12212011546.
The previous prime is 12212011501. The next prime is 12212011549. The reversal of 12212011547 is 74511021221.
12212011547 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12212011547 - 28 = 12212011291 is a prime.
It is a super-2 number, since 2×122120115472 (a number of 21 digits) contains 22 as substring.
Together with 12212011549, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (12212011549) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6106005773 + 6106005774.
It is an arithmetic number, because the mean of its divisors is an integer number (6106005774).
Almost surely, 212212011547 is an apocalyptic number.
12212011547 is a deficient number, since it is larger than the sum of its proper divisors (1).
12212011547 is an equidigital number, since it uses as much as digits as its factorization.
12212011547 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1120, while the sum is 26.
Adding to 12212011547 its reverse (74511021221), we get a palindrome (86723032768).
The spelling of 12212011547 in words is "twelve billion, two hundred twelve million, eleven thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •