Base | Representation |
---|---|
bin | 11001010011100011001100… |
… | …01111001110001000000000 |
3 | 21022000211102211011100201220 |
4 | 30221301212033032020000 |
5 | 24243211143224144044 |
6 | 314204004430555040 |
7 | 14502246153536232 |
oct | 1451614617161000 |
9 | 238024384140656 |
10 | 55647311553024 |
11 | 1680498a716194 |
12 | 62a89a4068a80 |
13 | 2508699214419 |
14 | da54b689c252 |
15 | 6677aaa42019 |
hex | 329c663ce200 |
55647311553024 has 160 divisors (see below), whose sum is σ = 151937172541440. Its totient is φ = 18090285453312.
The previous prime is 55647311553019. The next prime is 55647311553073. The reversal of 55647311553024 is 42035511374655.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19068457 + ... + 21792215.
It is an arithmetic number, because the mean of its divisors is an integer number (949607328384).
Almost surely, 255647311553024 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 55647311553024, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75968586270720).
55647311553024 is an abundant number, since it is smaller than the sum of its proper divisors (96289860988416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55647311553024 is a wasteful number, since it uses less digits than its factorization.
55647311553024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2724110 (or 2724094 counting only the distinct ones).
The product of its (nonzero) digits is 7560000, while the sum is 51.
The spelling of 55647311553024 in words is "fifty-five trillion, six hundred forty-seven billion, three hundred eleven million, five hundred fifty-three thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •