Base | Representation |
---|---|
bin | 1001101100100010000010… |
… | …01111010110011001010001 |
3 | 2210111022000220110220111202 |
4 | 10312101001033112121101 |
5 | 10243312021410402043 |
6 | 113202513044120545 |
7 | 4330261664303051 |
oct | 466210117263121 |
9 | 83438026426452 |
10 | 21321312200273 |
11 | 6880354989788 |
12 | 2484268396155 |
13 | bb878b8a2c67 |
14 | 539d580a7561 |
15 | 26e939d271b8 |
hex | 1364413d6651 |
21321312200273 has 2 divisors, whose sum is σ = 21321312200274. Its totient is φ = 21321312200272.
The previous prime is 21321312200231. The next prime is 21321312200281. The reversal of 21321312200273 is 37200221312312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21164204608849 + 157107591424 = 4600457^2 + 396368^2 .
It is a cyclic number.
It is not a de Polignac number, because 21321312200273 - 210 = 21321312199249 is a prime.
It is a super-2 number, since 2×213213122002732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21321312200473) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10660656100136 + 10660656100137.
It is an arithmetic number, because the mean of its divisors is an integer number (10660656100137).
Almost surely, 221321312200273 is an apocalyptic number.
It is an amenable number.
21321312200273 is a deficient number, since it is larger than the sum of its proper divisors (1).
21321312200273 is an equidigital number, since it uses as much as digits as its factorization.
21321312200273 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6048, while the sum is 29.
Adding to 21321312200273 its reverse (37200221312312), we get a palindrome (58521533512585).
The spelling of 21321312200273 in words is "twenty-one trillion, three hundred twenty-one billion, three hundred twelve million, two hundred thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •