Base | Representation |
---|---|
bin | 1001100110101111101110… |
… | …10011111110011100001001 |
3 | 2202210021212120122121022222 |
4 | 10303113313103332130021 |
5 | 10232032341332401043 |
6 | 112531313305423425 |
7 | 4310023216355066 |
oct | 463276723763411 |
9 | 82707776577288 |
10 | 21122503403273 |
11 | 6804004565a78 |
12 | 245182379ab75 |
13 | ba2ac72b813c |
14 | 5304982a5c6d |
15 | 2696a1251d68 |
hex | 1335f74fe709 |
21122503403273 has 2 divisors, whose sum is σ = 21122503403274. Its totient is φ = 21122503403272.
The previous prime is 21122503403167. The next prime is 21122503403293. The reversal of 21122503403273 is 37230430522112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18316114551289 + 2806388851984 = 4279733^2 + 1675228^2 .
It is a cyclic number.
It is not a de Polignac number, because 21122503403273 - 212 = 21122503399177 is a prime.
It is a super-2 number, since 2×211225034032732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21122503403293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10561251701636 + 10561251701637.
It is an arithmetic number, because the mean of its divisors is an integer number (10561251701637).
Almost surely, 221122503403273 is an apocalyptic number.
It is an amenable number.
21122503403273 is a deficient number, since it is larger than the sum of its proper divisors (1).
21122503403273 is an equidigital number, since it uses as much as digits as its factorization.
21122503403273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 35.
Adding to 21122503403273 its reverse (37230430522112), we get a palindrome (58352933925385).
The spelling of 21122503403273 in words is "twenty-one trillion, one hundred twenty-two billion, five hundred three million, four hundred three thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •