Base | Representation |
---|---|
bin | 110100101111111000… |
… | …111000101100011000 |
3 | 12102012012102100002200 |
4 | 310233320320230120 |
5 | 1411443313010110 |
6 | 42004045130200 |
7 | 4043354123616 |
oct | 645770705430 |
9 | 172165370080 |
10 | 56638016280 |
11 | 22024757a1a |
12 | ab87b59960 |
13 | 5458085001 |
14 | 2a541806b6 |
15 | 17175096c0 |
hex | d2fe38b18 |
56638016280 has 96 divisors (see below), whose sum is σ = 184148696160. Its totient is φ = 15097305600.
The previous prime is 56638016261. The next prime is 56638016287. The reversal of 56638016280 is 8261083665.
56638016280 is a `hidden beast` number, since 5 + 6 + 638 + 0 + 1 + 6 + 2 + 8 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56638016287) 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, 887524 + ... + 949196.
It is an arithmetic number, because the mean of its divisors is an integer number (1918215585).
Almost surely, 256638016280 is an apocalyptic number.
It is an amenable number.
56638016280 is an abundant number, since it is smaller than the sum of its proper divisors (127510679880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56638016280 is a wasteful number, since it uses less digits than its factorization.
56638016280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64241 (or 64234 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 45.
It can be divided in two parts, 566380 and 16280, that added together give a triangular number (582660 = T1079).
The spelling of 56638016280 in words is "fifty-six billion, six hundred thirty-eight million, sixteen thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •