Base | Representation |
---|---|
bin | 110111101101000110111111… |
… | …1111001101001000100001011 |
3 | 2101020220002200010202010000102 |
4 | 1233122031333321221010023 |
5 | 1003210403033330041121 |
6 | 4454035542220000015 |
7 | 205131145410306014 |
oct | 15732157771510413 |
9 | 2336802603663012 |
10 | 489984899846411 |
11 | 13214047a0a0982 |
12 | 46b5643369000b |
13 | 180534bb023a58 |
14 | 88dd577ab600b |
15 | 3b9a971eb090b |
hex | 1bda37fe6910b |
489984899846411 has 2 divisors, whose sum is σ = 489984899846412. Its totient is φ = 489984899846410.
The previous prime is 489984899846369. The next prime is 489984899846413. The reversal of 489984899846411 is 114648998489984.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 489984899846411 - 210 = 489984899845387 is a prime.
It is a super-2 number, since 2×4899848998464112 (a number of 30 digits) contains 22 as substring.
Together with 489984899846413, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (489984899846413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 244992449923205 + 244992449923206.
It is an arithmetic number, because the mean of its divisors is an integer number (244992449923206).
Almost surely, 2489984899846411 is an apocalyptic number.
489984899846411 is a deficient number, since it is larger than the sum of its proper divisors (1).
489984899846411 is an equidigital number, since it uses as much as digits as its factorization.
489984899846411 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 41278242816, while the sum is 92.
The spelling of 489984899846411 in words is "four hundred eighty-nine trillion, nine hundred eighty-four billion, eight hundred ninety-nine million, eight hundred forty-six thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •