Base | Representation |
---|---|
bin | 1000000101011110… |
… | …1111000111010001 |
3 | 12121021010222010221 |
4 | 2001113233013101 |
5 | 13421120430103 |
6 | 555212553041 |
7 | 104533542136 |
oct | 20127570721 |
9 | 5537128127 |
10 | 2170483153 |
11 | a141aa133 |
12 | 506a82781 |
13 | 287898577 |
14 | 16839658d |
15 | ca83b1bd |
hex | 815ef1d1 |
2170483153 has 2 divisors, whose sum is σ = 2170483154. Its totient is φ = 2170483152.
The previous prime is 2170483127. The next prime is 2170483187. The reversal of 2170483153 is 3513840712.
2170483153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (2170483187) can be obtained adding 2170483153 to its sum of digits (34).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1834237584 + 336245569 = 42828^2 + 18337^2 .
It is a cyclic number.
It is not a de Polignac number, because 2170483153 - 25 = 2170483121 is a prime.
It is not a weakly prime, because it can be changed into another prime (2170483103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1085241576 + 1085241577.
It is an arithmetic number, because the mean of its divisors is an integer number (1085241577).
Almost surely, 22170483153 is an apocalyptic number.
It is an amenable number.
2170483153 is a deficient number, since it is larger than the sum of its proper divisors (1).
2170483153 is an equidigital number, since it uses as much as digits as its factorization.
2170483153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20160, while the sum is 34.
The square root of 2170483153 is about 46588.4444148976. Note that the first 4 decimals coincide. The cubic root of 2170483153 is about 1294.7486685470.
The spelling of 2170483153 in words is "two billion, one hundred seventy million, four hundred eighty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •