Base | Representation |
---|---|
bin | 11001010011101011001100… |
… | …11110110011101111100000 |
3 | 21022001020112102120220111221 |
4 | 30221311212132303233200 |
5 | 24243243444303402220 |
6 | 314205555202344424 |
7 | 14502460535101063 |
oct | 1451654636635740 |
9 | 238036472526457 |
10 | 55651610606560 |
11 | 168067963977a1 |
12 | 62a97a395b114 |
13 | 2508c02a91b97 |
14 | da57a381a8da |
15 | 66795d18a9aa |
hex | 329d667b3be0 |
55651610606560 has 24 divisors (see below), whose sum is σ = 131476930058376. Its totient is φ = 22260644242560.
The previous prime is 55651610606521. The next prime is 55651610606623. The reversal of 55651610606560 is 6560601615655.
It is a super-2 number, since 2×556516106065602 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55651610606498 and 55651610606507.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 173911282986 + ... + 173911283305.
It is an arithmetic number, because the mean of its divisors is an integer number (5478205419099).
Almost surely, 255651610606560 is an apocalyptic number.
It is an amenable number.
55651610606560 is an abundant number, since it is smaller than the sum of its proper divisors (75825319451816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55651610606560 is a wasteful number, since it uses less digits than its factorization.
55651610606560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 347822566306 (or 347822566298 counting only the distinct ones).
The product of its (nonzero) digits is 4860000, while the sum is 52.
The spelling of 55651610606560 in words is "fifty-five trillion, six hundred fifty-one billion, six hundred ten million, six hundred six thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •