Base | Representation |
---|---|
bin | 1001101011111110011100… |
… | …01100011111100000101001 |
3 | 2210102110201002122102022121 |
4 | 10311333032030133200221 |
5 | 10243003402230432103 |
6 | 113150032510351241 |
7 | 4326014300063605 |
oct | 465771614374051 |
9 | 83373632572277 |
10 | 21302202202153 |
11 | 6873238883304 |
12 | 24806144bb521 |
13 | bb6a34700c72 |
14 | 539064098505 |
15 | 26e1bc2b06bd |
hex | 135fce31f829 |
21302202202153 has 2 divisors, whose sum is σ = 21302202202154. Its totient is φ = 21302202202152.
The previous prime is 21302202202147. The next prime is 21302202202283. The reversal of 21302202202153 is 35120220220312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21288737616784 + 13464585369 = 4613972^2 + 116037^2 .
It is a cyclic number.
It is not a de Polignac number, because 21302202202153 - 217 = 21302202071081 is a prime.
It is a super-2 number, since 2×213022022021532 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21302202202103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10651101101076 + 10651101101077.
It is an arithmetic number, because the mean of its divisors is an integer number (10651101101077).
Almost surely, 221302202202153 is an apocalyptic number.
It is an amenable number.
21302202202153 is a deficient number, since it is larger than the sum of its proper divisors (1).
21302202202153 is an equidigital number, since it uses as much as digits as its factorization.
21302202202153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 21302202202153 its reverse (35120220220312), we get a palindrome (56422422422465).
The spelling of 21302202202153 in words is "twenty-one trillion, three hundred two billion, two hundred two million, two hundred two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •