Base | Representation |
---|---|
bin | 1001101100001101011001… |
… | …01100100100111000110001 |
3 | 2210110020102120121000002112 |
4 | 10312012230230210320301 |
5 | 10243121322402401113 |
6 | 113153441244455105 |
7 | 4326420240220046 |
oct | 466065454447061 |
9 | 83406376530075 |
10 | 21310230122033 |
11 | 6876688390336 |
12 | 2482094b4a495 |
13 | bb771396b308 |
14 | 5395c634d1cd |
15 | 26e4dbe735a8 |
hex | 1361acb24e31 |
21310230122033 has 2 divisors, whose sum is σ = 21310230122034. Its totient is φ = 21310230122032.
The previous prime is 21310230122023. The next prime is 21310230122039. The reversal of 21310230122033 is 33022103201312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16658413686784 + 4651816435249 = 4081472^2 + 2156807^2 .
It is a cyclic number.
It is not a de Polignac number, because 21310230122033 - 212 = 21310230117937 is a prime.
It is a super-2 number, since 2×213102301220332 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21310230122039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10655115061016 + 10655115061017.
It is an arithmetic number, because the mean of its divisors is an integer number (10655115061017).
Almost surely, 221310230122033 is an apocalyptic number.
It is an amenable number.
21310230122033 is a deficient number, since it is larger than the sum of its proper divisors (1).
21310230122033 is an equidigital number, since it uses as much as digits as its factorization.
21310230122033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 21310230122033 its reverse (33022103201312), we get a palindrome (54332333323345).
The spelling of 21310230122033 in words is "twenty-one trillion, three hundred ten billion, two hundred thirty million, one hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •