Base | Representation |
---|---|
bin | 1000010000010111… |
… | …1101000010101001 |
3 | 12201110002020202021 |
4 | 2010011331002221 |
5 | 14014313401012 |
6 | 1003523504441 |
7 | 105626664133 |
oct | 20405750251 |
9 | 5643066667 |
10 | 2216153257 |
11 | a37a6281a |
12 | 51a228121 |
13 | 294198bb6 |
14 | 170484053 |
15 | ce85d007 |
hex | 8417d0a9 |
2216153257 has 2 divisors, whose sum is σ = 2216153258. Its totient is φ = 2216153256.
The previous prime is 2216153249. The next prime is 2216153263. The reversal of 2216153257 is 7523516122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2216149776 + 3481 = 47076^2 + 59^2 .
It is a cyclic number.
It is not a de Polignac number, because 2216153257 - 23 = 2216153249 is a prime.
It is a super-2 number, since 2×22161532572 = 9822670517023416098, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2216153957) 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, 1108076628 + 1108076629.
It is an arithmetic number, because the mean of its divisors is an integer number (1108076629).
Almost surely, 22216153257 is an apocalyptic number.
It is an amenable number.
2216153257 is a deficient number, since it is larger than the sum of its proper divisors (1).
2216153257 is an equidigital number, since it uses as much as digits as its factorization.
2216153257 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 25200, while the sum is 34.
The square root of 2216153257 is about 47076.0369721157. The cubic root of 2216153257 is about 1303.7668375146.
Adding to 2216153257 its reverse (7523516122), we get a palindrome (9739669379).
The spelling of 2216153257 in words is "two billion, two hundred sixteen million, one hundred fifty-three thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •