Base | Representation |
---|---|
bin | 11010111011011110… |
… | …000001000000111111 |
3 | 2202122010200210011022 |
4 | 122323132001000333 |
5 | 433204220333042 |
6 | 21141113014355 |
7 | 2042353354334 |
oct | 327336010077 |
9 | 82563623138 |
10 | 28915011647 |
11 | 11298852245 |
12 | 572b6b43bb |
13 | 295a66c162 |
14 | 15842d698b |
15 | b4375acd2 |
hex | 6bb78103f |
28915011647 has 2 divisors, whose sum is σ = 28915011648. Its totient is φ = 28915011646.
The previous prime is 28915011599. The next prime is 28915011679. The reversal of 28915011647 is 74611051982.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 28915011647 - 212 = 28915007551 is a prime.
It is a super-2 number, since 2×289150116472 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 28915011598 and 28915011607.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (28915011247) 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, 14457505823 + 14457505824.
It is an arithmetic number, because the mean of its divisors is an integer number (14457505824).
Almost surely, 228915011647 is an apocalyptic number.
28915011647 is a deficient number, since it is larger than the sum of its proper divisors (1).
28915011647 is an equidigital number, since it uses as much as digits as its factorization.
28915011647 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 spelling of 28915011647 in words is "twenty-eight billion, nine hundred fifteen million, eleven thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •