Base | Representation |
---|---|
bin | 1001100110011100110001… |
… | …00010000101100010011001 |
3 | 2202202022121010001102012102 |
4 | 10303032120202011202121 |
5 | 10231401014233112444 |
6 | 112522511211253145 |
7 | 4306213024240532 |
oct | 463163042054231 |
9 | 82668533042172 |
10 | 21112323332249 |
11 | 67aa76013aa36 |
12 | 244b86244a1b5 |
13 | ba1b64200686 |
14 | 52dbb026b689 |
15 | 2692a767484e |
hex | 133398885899 |
21112323332249 has 2 divisors, whose sum is σ = 21112323332250. Its totient is φ = 21112323332248.
The previous prime is 21112323332189. The next prime is 21112323332251. The reversal of 21112323332249 is 94223332321112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20702108701849 + 410214630400 = 4549957^2 + 640480^2 .
It is a cyclic number.
It is not a de Polignac number, because 21112323332249 - 212 = 21112323328153 is a prime.
Together with 21112323332251, 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 (21112323332549) 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, 10556161666124 + 10556161666125.
It is an arithmetic number, because the mean of its divisors is an integer number (10556161666125).
Almost surely, 221112323332249 is an apocalyptic number.
It is an amenable number.
21112323332249 is a deficient number, since it is larger than the sum of its proper divisors (1).
21112323332249 is an equidigital number, since it uses as much as digits as its factorization.
21112323332249 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 93312, while the sum is 38.
The spelling of 21112323332249 in words is "twenty-one trillion, one hundred twelve billion, three hundred twenty-three million, three hundred thirty-two thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •