Base | Representation |
---|---|
bin | 1111000000001110… |
… | …11010001101001111 |
3 | 202210100220200222201 |
4 | 13200013122031033 |
5 | 112444040143111 |
6 | 3411142422331 |
7 | 403416264412 |
oct | 74007321517 |
9 | 22710820881 |
10 | 8055006031 |
11 | 3463928286 |
12 | 16897319a7 |
13 | 9b4a61c77 |
14 | 565b05b79 |
15 | 3222636c1 |
hex | 1e01da34f |
8055006031 has 2 divisors, whose sum is σ = 8055006032. Its totient is φ = 8055006030.
The previous prime is 8055006013. The next prime is 8055006049. The reversal of 8055006031 is 1306005508.
Together with previous prime (8055006013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (8055006013) and next prime (8055006049).
It is a cyclic number.
It is not a de Polignac number, because 8055006031 - 25 = 8055005999 is a prime.
It is a super-2 number, since 2×80550060312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8055006131) 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, 4027503015 + 4027503016.
It is an arithmetic number, because the mean of its divisors is an integer number (4027503016).
Almost surely, 28055006031 is an apocalyptic number.
8055006031 is a deficient number, since it is larger than the sum of its proper divisors (1).
8055006031 is an equidigital number, since it uses as much as digits as its factorization.
8055006031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 28.
The square root of 8055006031 is about 89749.6854089194. The cubic root of 8055006031 is about 2004.5733700884.
The spelling of 8055006031 in words is "eight billion, fifty-five million, six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •