Base | Representation |
---|---|
bin | 11001000010100111010110… |
… | …11110010111110101111100 |
3 | 21012222012111120212222111010 |
4 | 30201103223132113311330 |
5 | 24204143000410424320 |
6 | 313040413202355220 |
7 | 14412226502416530 |
oct | 1441235336276574 |
9 | 235865446788433 |
10 | 55065431342460 |
11 | 16600133492690 |
12 | 621407165bb10 |
13 | 2495856569616 |
14 | d85276d07bc0 |
15 | 6575a1840ae0 |
hex | 3214eb797d7c |
55065431342460 has 384 divisors, whose sum is σ = 196356980736000. Its totient is φ = 11196515404800.
The previous prime is 55065431342459. The next prime is 55065431342491. The reversal of 55065431342460 is 6424313456055.
It is a super-2 number, since 2×550654313424602 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1248315805 + ... + 1248359915.
It is an arithmetic number, because the mean of its divisors is an integer number (511346304000).
Almost surely, 255065431342460 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 55065431342460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (98178490368000).
55065431342460 is an abundant number, since it is smaller than the sum of its proper divisors (141291549393540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55065431342460 is a wasteful number, since it uses less digits than its factorization.
55065431342460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49937 (or 49935 counting only the distinct ones).
The product of its (nonzero) digits is 5184000, while the sum is 48.
The spelling of 55065431342460 in words is "fifty-five trillion, sixty-five billion, four hundred thirty-one million, three hundred forty-two thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •