Base | Representation |
---|---|
bin | 1001101001100101010101… |
… | …01000100001111100001001 |
3 | 2210010121112100221112101102 |
4 | 10310302222220201330021 |
5 | 10240132030301144422 |
6 | 113044200045431145 |
7 | 4320044261043053 |
oct | 464625250417411 |
9 | 83117470845342 |
10 | 21220001193737 |
11 | 6841396519005 |
12 | 24686b356b4b5 |
13 | bac0645a3808 |
14 | 5350a6c9c8d3 |
15 | 26beaa976192 |
hex | 134caaa21f09 |
21220001193737 has 2 divisors, whose sum is σ = 21220001193738. Its totient is φ = 21220001193736.
The previous prime is 21220001193641. The next prime is 21220001193793. The reversal of 21220001193737 is 73739110002212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21043312115401 + 176689078336 = 4587299^2 + 420344^2 .
It is a cyclic number.
It is not a de Polignac number, because 21220001193737 - 212 = 21220001189641 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21220001193737.
It is not a weakly prime, because it can be changed into another prime (21220001193137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10610000596868 + 10610000596869.
It is an arithmetic number, because the mean of its divisors is an integer number (10610000596869).
Almost surely, 221220001193737 is an apocalyptic number.
It is an amenable number.
21220001193737 is a deficient number, since it is larger than the sum of its proper divisors (1).
21220001193737 is an equidigital number, since it uses as much as digits as its factorization.
21220001193737 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31752, while the sum is 38.
Adding to 21220001193737 its reverse (73739110002212), we get a palindrome (94959111195949).
The spelling of 21220001193737 in words is "twenty-one trillion, two hundred twenty billion, one million, one hundred ninety-three thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •