Base | Representation |
---|---|
bin | 11000100100001101110010… |
… | …00111111011110111001111 |
3 | 21002021100102001212000012011 |
4 | 30102012321013323313033 |
5 | 24040034310321000314 |
6 | 310520510243322051 |
7 | 14243611332561445 |
oct | 1422067107736717 |
9 | 232240361760164 |
10 | 54020909546959 |
11 | 16238159131883 |
12 | 6085745380327 |
13 | 241b1c44832b4 |
14 | d4a8a9952b95 |
15 | 63a31b64b4c4 |
hex | 3121b91fbdcf |
54020909546959 has 8 divisors (see below), whose sum is σ = 54268681834512. Its totient is φ = 53773537863360.
The previous prime is 54020909546957. The next prime is 54020909546971. The reversal of 54020909546959 is 95964590902045.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 54020909546959 - 21 = 54020909546957 is a prime.
It is a super-2 number, since 2×540209095469592 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 54020909546894 and 54020909546903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54020909546957) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 99880672 + ... + 100420069.
It is an arithmetic number, because the mean of its divisors is an integer number (6783585229314).
Almost surely, 254020909546959 is an apocalyptic number.
54020909546959 is a deficient number, since it is larger than the sum of its proper divisors (247772287553).
54020909546959 is a wasteful number, since it uses less digits than its factorization.
54020909546959 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200301977.
The product of its (nonzero) digits is 157464000, while the sum is 67.
The spelling of 54020909546959 in words is "fifty-four trillion, twenty billion, nine hundred nine million, five hundred forty-six thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •