Base | Representation |
---|---|
bin | 1001100011100010010010… |
… | …11011101111111111101001 |
3 | 2202101202012011221222202001 |
4 | 10301301021123233333221 |
5 | 10223231002234221043 |
6 | 112404513230411001 |
7 | 4266040126166212 |
oct | 461611133577751 |
9 | 82352164858661 |
10 | 21012212023273 |
11 | 6771257999849 |
12 | 2434383360a61 |
13 | b9559b61ab43 |
14 | 528dd4514409 |
15 | 26689879e74d |
hex | 131c496effe9 |
21012212023273 has 2 divisors, whose sum is σ = 21012212023274. Its totient is φ = 21012212023272.
The previous prime is 21012212023223. The next prime is 21012212023321. The reversal of 21012212023273 is 37232021221012.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18907121525824 + 2105090497449 = 4348232^2 + 1450893^2 .
It is a cyclic number.
It is not a de Polignac number, because 21012212023273 - 241 = 18813188767721 is a prime.
It is a super-2 number, since 2×210122120232732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21012212023223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10506106011636 + 10506106011637.
It is an arithmetic number, because the mean of its divisors is an integer number (10506106011637).
Almost surely, 221012212023273 is an apocalyptic number.
It is an amenable number.
21012212023273 is a deficient number, since it is larger than the sum of its proper divisors (1).
21012212023273 is an equidigital number, since it uses as much as digits as its factorization.
21012212023273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 28.
Adding to 21012212023273 its reverse (37232021221012), we get a palindrome (58244233244285).
The spelling of 21012212023273 in words is "twenty-one trillion, twelve billion, two hundred twelve million, twenty-three thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •