Base | Representation |
---|---|
bin | 1000010000100111… |
… | …0011100101111101 |
3 | 12201111222120001002 |
4 | 2010021303211331 |
5 | 14020043210013 |
6 | 1004001300045 |
7 | 105641401313 |
oct | 20411634575 |
9 | 5644876032 |
10 | 2217163133 |
11 | a38592529 |
12 | 51a634625 |
13 | 294460763 |
14 | 1706680b3 |
15 | ce9ac358 |
hex | 8427397d |
2217163133 has 2 divisors, whose sum is σ = 2217163134. Its totient is φ = 2217163132.
The previous prime is 2217163057. The next prime is 2217163139. The reversal of 2217163133 is 3313617122.
2217163133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2071888324 + 145274809 = 45518^2 + 12053^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2217163133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2217163096 and 2217163105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2217163139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1108581566 + 1108581567.
It is an arithmetic number, because the mean of its divisors is an integer number (1108581567).
It is a self-describing number.
Almost surely, 22217163133 is an apocalyptic number.
It is an amenable number.
2217163133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2217163133 is an equidigital number, since it uses as much as digits as its factorization.
2217163133 is an evil number, because the sum of its binary digits is even.
The product of its digits is 4536, while the sum is 29.
The square root of 2217163133 is about 47086.7617595434. The cubic root of 2217163133 is about 1303.9648447135.
The spelling of 2217163133 in words is "two billion, two hundred seventeen million, one hundred sixty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •