Base | Representation |
---|---|
bin | 1111000011111011… |
… | …01011010101000101 |
3 | 202212112020211021122 |
4 | 13201331223111011 |
5 | 113030004243112 |
6 | 3414211123325 |
7 | 404243641502 |
oct | 74175532505 |
9 | 22775224248 |
10 | 8086009157 |
11 | 347a3833a6 |
12 | 1697ba3545 |
13 | 9bb2c8705 |
14 | 569c964a9 |
15 | 324d39872 |
hex | 1e1f6b545 |
8086009157 has 2 divisors, whose sum is σ = 8086009158. Its totient is φ = 8086009156.
The previous prime is 8086009123. The next prime is 8086009201. The reversal of 8086009157 is 7519006808.
It is a happy number.
It is an a-pointer prime, because the next prime (8086009201) can be obtained adding 8086009157 to its sum of digits (44).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5977454596 + 2108554561 = 77314^2 + 45919^2 .
It is a cyclic number.
It is not a de Polignac number, because 8086009157 - 28 = 8086008901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8086009357) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4043004578 + 4043004579.
It is an arithmetic number, because the mean of its divisors is an integer number (4043004579).
Almost surely, 28086009157 is an apocalyptic number.
It is an amenable number.
8086009157 is a deficient number, since it is larger than the sum of its proper divisors (1).
8086009157 is an equidigital number, since it uses as much as digits as its factorization.
8086009157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120960, while the sum is 44.
The square root of 8086009157 is about 89922.2395016939. The cubic root of 8086009157 is about 2007.1418960533.
The spelling of 8086009157 in words is "eight billion, eighty-six million, nine thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •