Base | Representation |
---|---|
bin | 110100101000100011… |
… | …101011011111001010 |
3 | 12101212121222022022211 |
4 | 310220203223133022 |
5 | 1411220321013100 |
6 | 41543532535334 |
7 | 4040331500251 |
oct | 645043533712 |
9 | 171777868284 |
10 | 56515016650 |
11 | 21a71287534 |
12 | ab5292154a |
13 | 543874a971 |
14 | 2a41ac3798 |
15 | 170b8101ba |
hex | d288eb7ca |
56515016650 has 48 divisors (see below), whose sum is σ = 107195192640. Its totient is φ = 22162851200.
The previous prime is 56515016627. The next prime is 56515016653. The reversal of 56515016650 is 5661051565.
It is not an unprimeable number, because it can be changed into a prime (56515016653) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 590982 + ... + 679918.
It is an arithmetic number, because the mean of its divisors is an integer number (2233233180).
Almost surely, 256515016650 is an apocalyptic number.
56515016650 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56515016650 is a deficient number, since it is larger than the sum of its proper divisors (50680175990).
56515016650 is a wasteful number, since it uses less digits than its factorization.
56515016650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89199 (or 89194 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 40.
The spelling of 56515016650 in words is "fifty-six billion, five hundred fifteen million, sixteen thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •