Base | Representation |
---|---|
bin | 11010010000110… |
… | …10101000010001 |
3 | 120100112220112212 |
4 | 31020122220101 |
5 | 422344410113 |
6 | 33510001505 |
7 | 5313414206 |
oct | 1510325021 |
9 | 510486485 |
10 | 220310033 |
11 | 1033a5209 |
12 | 61946295 |
13 | 36848888 |
14 | 2138bcad |
15 | 1451c0a8 |
hex | d21aa11 |
220310033 has 2 divisors, whose sum is σ = 220310034. Its totient is φ = 220310032.
The previous prime is 220310023. The next prime is 220310053. The reversal of 220310033 is 330013022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119749249 + 100560784 = 10943^2 + 10028^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220310033 is a prime.
It is a super-2 number, since 2×2203100332 = 97073021280922178, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (220310023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110155016 + 110155017.
It is an arithmetic number, because the mean of its divisors is an integer number (110155017).
Almost surely, 2220310033 is an apocalyptic number.
It is an amenable number.
220310033 is a deficient number, since it is larger than the sum of its proper divisors (1).
220310033 is an equidigital number, since it uses as much as digits as its factorization.
220310033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 14.
The square root of 220310033 is about 14842.8445050132. The cubic root of 220310033 is about 603.9645179294.
Adding to 220310033 its reverse (330013022), we get a palindrome (550323055).
The spelling of 220310033 in words is "two hundred twenty million, three hundred ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •