Base | Representation |
---|---|
bin | 1100110100000010110… |
… | …1001010111011000001 |
3 | 210001012011101112001212 |
4 | 3031000231022323001 |
5 | 12101311000241022 |
6 | 245043102335505 |
7 | 21621666622535 |
oct | 3150055127301 |
9 | 701164345055 |
10 | 220128915137 |
11 | 853a104105a |
12 | 367b488a595 |
13 | 179b1622851 |
14 | a923563bc5 |
15 | 5ad56a73e2 |
hex | 3340b4aec1 |
220128915137 has 2 divisors, whose sum is σ = 220128915138. Its totient is φ = 220128915136.
The previous prime is 220128915107. The next prime is 220128915173. The reversal of 220128915137 is 731519821022.
Together with next prime (220128915173) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 186931710736 + 33197204401 = 432356^2 + 182201^2 .
It is a cyclic number.
It is not a de Polignac number, because 220128915137 - 222 = 220124720833 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220128915094 and 220128915103.
It is not a weakly prime, because it can be changed into another prime (220128915107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110064457568 + 110064457569.
It is an arithmetic number, because the mean of its divisors is an integer number (110064457569).
Almost surely, 2220128915137 is an apocalyptic number.
It is an amenable number.
220128915137 is a deficient number, since it is larger than the sum of its proper divisors (1).
220128915137 is an equidigital number, since it uses as much as digits as its factorization.
220128915137 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 41.
The spelling of 220128915137 in words is "two hundred twenty billion, one hundred twenty-eight million, nine hundred fifteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •