Base | Representation |
---|---|
bin | 1001101011111100001111… |
… | …10111100100011100101001 |
3 | 2210102100122212110210121221 |
4 | 10311332013313210130221 |
5 | 10242443443202442413 |
6 | 113145315441302041 |
7 | 4325643122143366 |
oct | 465760767443451 |
9 | 83370585423557 |
10 | 21301022312233 |
11 | 6872792862574 |
12 | 2480345334921 |
13 | bb68a712b051 |
14 | 538d914c146d |
15 | 26e14d8e868d |
hex | 135f87de4729 |
21301022312233 has 2 divisors, whose sum is σ = 21301022312234. Its totient is φ = 21301022312232.
The previous prime is 21301022312203. The next prime is 21301022312287. The reversal of 21301022312233 is 33221322010312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18551007039744 + 2750015272489 = 4307088^2 + 1658317^2 .
It is a cyclic number.
It is not a de Polignac number, because 21301022312233 - 221 = 21301020215081 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21301022312198 and 21301022312207.
It is not a weakly prime, because it can be changed into another prime (21301022312203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10650511156116 + 10650511156117.
It is an arithmetic number, because the mean of its divisors is an integer number (10650511156117).
Almost surely, 221301022312233 is an apocalyptic number.
It is an amenable number.
21301022312233 is a deficient number, since it is larger than the sum of its proper divisors (1).
21301022312233 is an equidigital number, since it uses as much as digits as its factorization.
21301022312233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 21301022312233 its reverse (33221322010312), we get a palindrome (54522344322545).
The spelling of 21301022312233 in words is "twenty-one trillion, three hundred one billion, twenty-two million, three hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •