Base | Representation |
---|---|
bin | 1000010000011010… |
… | …1000111101010001 |
3 | 12201110102101111111 |
4 | 2010012220331101 |
5 | 14014340130022 |
6 | 1003531413321 |
7 | 105631343434 |
oct | 20406507521 |
9 | 5643371444 |
10 | 2216333137 |
11 | a38075987 |
12 | 51a2b4241 |
13 | 29422ca35 |
14 | 1704cd81b |
15 | ce896477 |
hex | 841a8f51 |
2216333137 has 2 divisors, whose sum is σ = 2216333138. Its totient is φ = 2216333136.
The previous prime is 2216333117. The next prime is 2216333159. The reversal of 2216333137 is 7313336122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1648035216 + 568297921 = 40596^2 + 23839^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2216333137 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2216333099 and 2216333108.
It is not a weakly prime, because it can be changed into another prime (2216333117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1108166568 + 1108166569.
It is an arithmetic number, because the mean of its divisors is an integer number (1108166569).
Almost surely, 22216333137 is an apocalyptic number.
It is an amenable number.
2216333137 is a deficient number, since it is larger than the sum of its proper divisors (1).
2216333137 is an equidigital number, since it uses as much as digits as its factorization.
2216333137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13608, while the sum is 31.
The square root of 2216333137 is about 47077.9474595059. The cubic root of 2216333137 is about 1303.8021111332.
Adding to 2216333137 its reverse (7313336122), we get a palindrome (9529669259).
The spelling of 2216333137 in words is "two billion, two hundred sixteen million, three hundred thirty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •