Base | Representation |
---|---|
bin | 1001101001000100001100… |
… | …01100111011111001100001 |
3 | 2210001220121110212220001212 |
4 | 10310202012030323321201 |
5 | 10234334111242023243 |
6 | 113032054425035505 |
7 | 4315544350245305 |
oct | 464420614737141 |
9 | 83056543786055 |
10 | 21202210111073 |
11 | 683489695a302 |
12 | 2465169325b95 |
13 | baa48a730374 |
14 | 53429a0d5d05 |
15 | 26b7b8ad9318 |
hex | 13488633be61 |
21202210111073 has 2 divisors, whose sum is σ = 21202210111074. Its totient is φ = 21202210111072.
The previous prime is 21202210111067. The next prime is 21202210111109. The reversal of 21202210111073 is 37011101220212.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13986792171664 + 7215417939409 = 3739892^2 + 2686153^2 .
It is a cyclic number.
It is not a de Polignac number, because 21202210111073 - 216 = 21202210045537 is a prime.
It is a super-2 number, since 2×212022101110732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21202210111063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10601105055536 + 10601105055537.
It is an arithmetic number, because the mean of its divisors is an integer number (10601105055537).
Almost surely, 221202210111073 is an apocalyptic number.
It is an amenable number.
21202210111073 is a deficient number, since it is larger than the sum of its proper divisors (1).
21202210111073 is an equidigital number, since it uses as much as digits as its factorization.
21202210111073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 23.
Adding to 21202210111073 its reverse (37011101220212), we get a palindrome (58213311331285).
The spelling of 21202210111073 in words is "twenty-one trillion, two hundred two billion, two hundred ten million, one hundred eleven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •