Base | Representation |
---|---|
bin | 1000000011111111… |
… | …1101001000101101 |
3 | 12120211102020200022 |
4 | 2000333331020231 |
5 | 13413021433013 |
6 | 554431211525 |
7 | 104426546144 |
oct | 20077751055 |
9 | 5524366608 |
10 | 2164249133 |
11 | a10731452 |
12 | 504976ba5 |
13 | 2864c4bb7 |
14 | 16761275b |
15 | ca009008 |
hex | 80ffd22d |
2164249133 has 2 divisors, whose sum is σ = 2164249134. Its totient is φ = 2164249132.
The previous prime is 2164249121. The next prime is 2164249201. The reversal of 2164249133 is 3319424612.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1324814404 + 839434729 = 36398^2 + 28973^2 .
It is a cyclic number.
It is not a de Polignac number, because 2164249133 - 26 = 2164249069 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2164249093 and 2164249102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2164249333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1082124566 + 1082124567.
It is an arithmetic number, because the mean of its divisors is an integer number (1082124567).
Almost surely, 22164249133 is an apocalyptic number.
It is an amenable number.
2164249133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2164249133 is an equidigital number, since it uses as much as digits as its factorization.
2164249133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31104, while the sum is 35.
The square root of 2164249133 is about 46521.4910874533. The cubic root of 2164249133 is about 1293.5078957987.
The spelling of 2164249133 in words is "two billion, one hundred sixty-four million, two hundred forty-nine thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •