Base | Representation |
---|---|
bin | 11000110011011100110010… |
… | …10011000011110101101011 |
3 | 21011010101112100020120112001 |
4 | 30121232121103003311223 |
5 | 24122123323032234121 |
6 | 312001200033431431 |
7 | 14326462061620462 |
oct | 1431563123036553 |
9 | 234111470216461 |
10 | 54544361602411 |
11 | 1641a15217968a |
12 | 614b09040b577 |
13 | 2458685229655 |
14 | d67d656d99d9 |
15 | 648c560d6991 |
hex | 319b994c3d6b |
54544361602411 has 4 divisors (see below), whose sum is σ = 54652799697552. Its totient is φ = 54435923507272.
The previous prime is 54544361602403. The next prime is 54544361602417. The reversal of 54544361602411 is 11420616344545.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 54544361602411 - 23 = 54544361602403 is a prime.
It is a super-2 number, since 2×545443616024112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (54544361602417) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54219046816 + ... + 54219047821.
It is an arithmetic number, because the mean of its divisors is an integer number (13663199924388).
Almost surely, 254544361602411 is an apocalyptic number.
54544361602411 is a deficient number, since it is larger than the sum of its proper divisors (108438095141).
54544361602411 is a wasteful number, since it uses less digits than its factorization.
54544361602411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108438095140.
The product of its (nonzero) digits is 1382400, while the sum is 46.
Adding to 54544361602411 its reverse (11420616344545), we get a palindrome (65964977946956).
The spelling of 54544361602411 in words is "fifty-four trillion, five hundred forty-four billion, three hundred sixty-one million, six hundred two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •