Base | Representation |
---|---|
bin | 11000110101101101100001… |
… | …10010000100111001001001 |
3 | 21011101211002121221012101022 |
4 | 30122312300302010321021 |
5 | 24124411442121123424 |
6 | 312101010311402225 |
7 | 14335212456025121 |
oct | 1432666062047111 |
9 | 234354077835338 |
10 | 54622065020489 |
11 | 1644a0a678977a |
12 | 6162157083375 |
13 | 2462ab9615045 |
14 | d6ba17455c81 |
15 | 64aca2b5b95e |
hex | 31adb0c84e49 |
54622065020489 has 2 divisors, whose sum is σ = 54622065020490. Its totient is φ = 54622065020488.
The previous prime is 54622065020389. The next prime is 54622065020503. The reversal of 54622065020489 is 98402056022645.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43440397810489 + 11181667210000 = 6590933^2 + 3343900^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-54622065020489 is a prime.
It is a super-4 number, since 4×546220650204894 (a number of 56 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 54622065020489.
It is not a weakly prime, because it can be changed into another prime (54622065020189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27311032510244 + 27311032510245.
It is an arithmetic number, because the mean of its divisors is an integer number (27311032510245).
Almost surely, 254622065020489 is an apocalyptic number.
It is an amenable number.
54622065020489 is a deficient number, since it is larger than the sum of its proper divisors (1).
54622065020489 is an equidigital number, since it uses as much as digits as its factorization.
54622065020489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8294400, while the sum is 53.
The spelling of 54622065020489 in words is "fifty-four trillion, six hundred twenty-two billion, sixty-five million, twenty thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •