Base | Representation |
---|---|
bin | 1100110011111110010… |
… | …1110100010101101101 |
3 | 210001010212012020000022 |
4 | 3030333211310111231 |
5 | 12101241203213123 |
6 | 245041153411525 |
7 | 21621351630032 |
oct | 3147745642555 |
9 | 701125166008 |
10 | 220110210413 |
11 | 85391525a05 |
12 | 367aa569ba5 |
13 | 179aa7a3b72 |
14 | a920c95389 |
15 | 5ad3c101c8 |
hex | 333f97456d |
220110210413 has 2 divisors, whose sum is σ = 220110210414. Its totient is φ = 220110210412.
The previous prime is 220110210379. The next prime is 220110210451. The reversal of 220110210413 is 314012011022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 118943593924 + 101166616489 = 344882^2 + 318067^2 .
It is a cyclic number.
It is not a de Polignac number, because 220110210413 - 218 = 220109948269 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220110210391 and 220110210400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220110210493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110055105206 + 110055105207.
It is an arithmetic number, because the mean of its divisors is an integer number (110055105207).
Almost surely, 2220110210413 is an apocalyptic number.
It is an amenable number.
220110210413 is a deficient number, since it is larger than the sum of its proper divisors (1).
220110210413 is an equidigital number, since it uses as much as digits as its factorization.
220110210413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 220110210413 its reverse (314012011022), we get a palindrome (534122221435).
The spelling of 220110210413 in words is "two hundred twenty billion, one hundred ten million, two hundred ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •