Base | Representation |
---|---|
bin | 1001100110011100100011… |
… | …11001011000110110101001 |
3 | 2202202022022100120011022001 |
4 | 10303032101321120312221 |
5 | 10231400302233001134 |
6 | 112522452153131001 |
7 | 4306210203030313 |
oct | 463162171306651 |
9 | 82668270504261 |
10 | 21112212000169 |
11 | 67aa703309554 |
12 | 244b8310b9a61 |
13 | ba1b4711cbc4 |
14 | 52db9d56a7b3 |
15 | 26929c9d2414 |
hex | 133391e58da9 |
21112212000169 has 2 divisors, whose sum is σ = 21112212000170. Its totient is φ = 21112212000168.
The previous prime is 21112212000151. The next prime is 21112212000181. The reversal of 21112212000169 is 96100021221112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12596536705600 + 8515675294569 = 3549160^2 + 2918163^2 .
It is a cyclic number.
It is not a de Polignac number, because 21112212000169 - 215 = 21112211967401 is a prime.
It is a super-2 number, since 2×211122120001692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21112212000569) 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, 10556106000084 + 10556106000085.
It is an arithmetic number, because the mean of its divisors is an integer number (10556106000085).
Almost surely, 221112212000169 is an apocalyptic number.
It is an amenable number.
21112212000169 is a deficient number, since it is larger than the sum of its proper divisors (1).
21112212000169 is an equidigital number, since it uses as much as digits as its factorization.
21112212000169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 28.
The spelling of 21112212000169 in words is "twenty-one trillion, one hundred twelve billion, two hundred twelve million, one hundred sixty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •