Base | Representation |
---|---|
bin | 111111000101001… |
… | …0100000111001001 |
3 | 12110111211002200001 |
4 | 1332022110013021 |
5 | 13313324224113 |
6 | 550010443001 |
7 | 103311040534 |
oct | 17612240711 |
9 | 5414732601 |
10 | 2116633033 |
11 | 9968697a9 |
12 | 4b0a33461 |
13 | 2796928a8 |
14 | 161179a1b |
15 | c5c507dd |
hex | 7e2941c9 |
2116633033 has 2 divisors, whose sum is σ = 2116633034. Its totient is φ = 2116633032.
The previous prime is 2116633027. The next prime is 2116633061. The reversal of 2116633033 is 3303366112.
It is an a-pointer prime, because the next prime (2116633061) can be obtained adding 2116633033 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1865980809 + 250652224 = 43197^2 + 15832^2 .
It is a cyclic number.
It is not a de Polignac number, because 2116633033 - 225 = 2083078601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2116632992 and 2116633010.
It is not a weakly prime, because it can be changed into another prime (2116633133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1058316516 + 1058316517.
It is an arithmetic number, because the mean of its divisors is an integer number (1058316517).
Almost surely, 22116633033 is an apocalyptic number.
It is an amenable number.
2116633033 is a deficient number, since it is larger than the sum of its proper divisors (1).
2116633033 is an equidigital number, since it uses as much as digits as its factorization.
2116633033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 28.
The square root of 2116633033 is about 46006.8802789322. The cubic root of 2116633033 is about 1283.9512167958.
Adding to 2116633033 its reverse (3303366112), we get a palindrome (5419999145).
The spelling of 2116633033 in words is "two billion, one hundred sixteen million, six hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •