Base | Representation |
---|---|
bin | 110100010110000110… |
… | …111110010001001100 |
3 | 12101002001120022101100 |
4 | 310112012332101030 |
5 | 1410102102022031 |
6 | 41453114543100 |
7 | 4026552610623 |
oct | 642606762114 |
9 | 171061508340 |
10 | 56205501516 |
11 | 219225a41aa |
12 | aa87137a90 |
13 | 53b959ac08 |
14 | 2a129546ba |
15 | 16de571de6 |
hex | d161be44c |
56205501516 has 72 divisors (see below), whose sum is σ = 143011041264. Its totient is φ = 18611913600.
The previous prime is 56205501509. The next prime is 56205501523. The reversal of 56205501516 is 61510550265.
56205501516 is a `hidden beast` number, since 5 + 620 + 5 + 5 + 0 + 15 + 16 = 666.
It is an interprime number because it is at equal distance from previous prime (56205501509) and next prime (56205501523).
It is a super-4 number, since 4×562055015164 (a number of 44 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9943291 + ... + 9948941.
It is an arithmetic number, because the mean of its divisors is an integer number (1986264462).
Almost surely, 256205501516 is an apocalyptic number.
It is an amenable number.
56205501516 is an abundant number, since it is smaller than the sum of its proper divisors (86805539748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56205501516 is a wasteful number, since it uses less digits than its factorization.
56205501516 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7431 (or 7426 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 36.
The spelling of 56205501516 in words is "fifty-six billion, two hundred five million, five hundred one thousand, five hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •