Base | Representation |
---|---|
bin | 101010010001011110110… |
… | …101111011010010001011 |
3 | 101021201021200110210202012 |
4 | 222101132311323102023 |
5 | 340043404201234414 |
6 | 10102311125530135 |
7 | 416610223551236 |
oct | 52213665732213 |
9 | 11251250423665 |
10 | 2904989086859 |
11 | a1aaa9674462 |
12 | 3ab00ab7394b |
13 | 180c2982a982 |
14 | a08606d641d |
15 | 5087350733e |
hex | 2a45ed7b48b |
2904989086859 has 2 divisors, whose sum is σ = 2904989086860. Its totient is φ = 2904989086858.
The previous prime is 2904989086841. The next prime is 2904989086861. The reversal of 2904989086859 is 9586809894092.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2904989086859 - 224 = 2904972309643 is a prime.
It is a super-3 number, since 3×29049890868593 (a number of 38 digits) contains 333 as substring.
Together with 2904989086861, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2904989086859.
It is not a weakly prime, because it can be changed into another prime (2904989086819) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1452494543429 + 1452494543430.
It is an arithmetic number, because the mean of its divisors is an integer number (1452494543430).
Almost surely, 22904989086859 is an apocalyptic number.
2904989086859 is a deficient number, since it is larger than the sum of its proper divisors (1).
2904989086859 is an equidigital number, since it uses as much as digits as its factorization.
2904989086859 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 806215680, while the sum is 77.
The spelling of 2904989086859 in words is "two trillion, nine hundred four billion, nine hundred eighty-nine million, eighty-six thousand, eight hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •