Base | Representation |
---|---|
bin | 110011010111110111… |
… | …010111000010000010 |
3 | 12021101021120101011110 |
4 | 303113313113002002 |
5 | 1400432233040000 |
6 | 41201332224150 |
7 | 3661642434012 |
oct | 632767270202 |
9 | 167337511143 |
10 | 55161221250 |
11 | 21437086a63 |
12 | a83546b056 |
13 | 5281128bb5 |
14 | 2953d9bc42 |
15 | 167ca45850 |
hex | cd7dd7082 |
55161221250 has 80 divisors (see below), whose sum is σ = 139124715840. Its totient is φ = 14574600000.
The previous prime is 55161221243. The next prime is 55161221263. The reversal of 55161221250 is 5212216155.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 39 ways as a sum of consecutive naturals, for example, 341275 + ... + 476225.
It is an arithmetic number, because the mean of its divisors is an integer number (1739058948).
Almost surely, 255161221250 is an apocalyptic number.
55161221250 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 55161221250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69562357920).
55161221250 is an abundant number, since it is smaller than the sum of its proper divisors (83963494590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55161221250 is a wasteful number, since it uses less digits than its factorization.
55161221250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135085 (or 135070 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 30.
The spelling of 55161221250 in words is "fifty-five billion, one hundred sixty-one million, two hundred twenty-one thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •