Base | Representation |
---|---|
bin | 1001101100100011101100… |
… | …01011010011011111000111 |
3 | 2210111101022210122200111222 |
4 | 10312101312023103133013 |
5 | 10243320331241112411 |
6 | 113203141131550555 |
7 | 4330323000302051 |
oct | 466216613233707 |
9 | 83441283580458 |
10 | 21322200332231 |
11 | 6880770245437 |
12 | 24844758bb45b |
13 | bb88a08a2726 |
14 | 53a0000148d1 |
15 | 26e98ccac4db |
hex | 1364762d37c7 |
21322200332231 has 2 divisors, whose sum is σ = 21322200332232. Its totient is φ = 21322200332230.
The previous prime is 21322200332227. The next prime is 21322200332311. The reversal of 21322200332231 is 13223300222312.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21322200332231 - 22 = 21322200332227 is a prime.
It is a super-2 number, since 2×213222003322312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21322200332231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21325200332231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10661100166115 + 10661100166116.
It is an arithmetic number, because the mean of its divisors is an integer number (10661100166116).
Almost surely, 221322200332231 is an apocalyptic number.
21322200332231 is a deficient number, since it is larger than the sum of its proper divisors (1).
21322200332231 is an equidigital number, since it uses as much as digits as its factorization.
21322200332231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 21322200332231 its reverse (13223300222312), we get a palindrome (34545500554543).
The spelling of 21322200332231 in words is "twenty-one trillion, three hundred twenty-two billion, two hundred million, three hundred thirty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •