Base | Representation |
---|---|
bin | 110100101000010000… |
… | …100110101010010110 |
3 | 12101212021120020221010 |
4 | 310220100212222112 |
5 | 1411213031004100 |
6 | 41543233433050 |
7 | 4040241132450 |
oct | 645020465226 |
9 | 171767506833 |
10 | 56510016150 |
11 | 21a69481595 |
12 | ab5110b786 |
13 | 54376b98a3 |
14 | 2a411812d0 |
15 | 170b173750 |
hex | d28426a96 |
56510016150 has 96 divisors (see below), whose sum is σ = 160228316160. Its totient is φ = 12911512320.
The previous prime is 56510016137. The next prime is 56510016151. The reversal of 56510016150 is 5161001565.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56510016151) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3108387 + ... + 3126513.
It is an arithmetic number, because the mean of its divisors is an integer number (1669044960).
Almost surely, 256510016150 is an apocalyptic number.
56510016150 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 56510016150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80114158080).
56510016150 is an abundant number, since it is smaller than the sum of its proper divisors (103718300010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56510016150 is a wasteful number, since it uses less digits than its factorization.
56510016150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21118 (or 21113 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 56510016150 in words is "fifty-six billion, five hundred ten million, sixteen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •