Base | Representation |
---|---|
bin | 10000000110100100… |
… | …11010011100100001 |
3 | 211022111021020100022 |
4 | 20003102122130201 |
5 | 120201120440103 |
6 | 3545502203225 |
7 | 424143036134 |
oct | 100322323441 |
9 | 24274236308 |
10 | 8645093153 |
11 | 3736a25494 |
12 | 1813283515 |
13 | a7a099848 |
14 | 5c022c21b |
15 | 358e74138 |
hex | 20349a721 |
8645093153 has 2 divisors, whose sum is σ = 8645093154. Its totient is φ = 8645093152.
The previous prime is 8645093131. The next prime is 8645093159. The reversal of 8645093153 is 3513905468.
8645093153 is digitally balanced in base 3, 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., 8595700369 + 49392784 = 92713^2 + 7028^2 .
It is a cyclic number.
It is not a de Polignac number, because 8645093153 - 210 = 8645092129 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (8645093159) 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, 4322546576 + 4322546577.
It is an arithmetic number, because the mean of its divisors is an integer number (4322546577).
Almost surely, 28645093153 is an apocalyptic number.
It is an amenable number.
8645093153 is a deficient number, since it is larger than the sum of its proper divisors (1).
8645093153 is an equidigital number, since it uses as much as digits as its factorization.
8645093153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 388800, while the sum is 44.
The square root of 8645093153 is about 92978.9930737046. The cubic root of 8645093153 is about 2052.3742590849.
The spelling of 8645093153 in words is "eight billion, six hundred forty-five million, ninety-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •