Base | Representation |
---|---|
bin | 110100111111111000… |
… | …100010101011000100 |
3 | 12102212220100200121000 |
4 | 310333320202223010 |
5 | 1413021012032130 |
6 | 42050432453300 |
7 | 4053123043410 |
oct | 647770425304 |
9 | 172786320530 |
10 | 56906361540 |
11 | 22152180766 |
12 | b0419aa230 |
13 | 549b84b8a2 |
14 | 2a7ba73d40 |
15 | 1730d64260 |
hex | d3fe22ac4 |
56906361540 has 384 divisors, whose sum is σ = 213463756800. Its totient is φ = 12294789120.
The previous prime is 56906361443. The next prime is 56906361557. The reversal of 56906361540 is 4516360965.
56906361540 is a `hidden beast` number, since 5 + 6 + 9 + 0 + 636 + 1 + 5 + 4 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
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 127 ways as a sum of consecutive naturals, for example, 58245532 + ... + 58246508.
It is an arithmetic number, because the mean of its divisors is an integer number (555895200).
Almost surely, 256906361540 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56906361540, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106731878400).
56906361540 is an abundant number, since it is smaller than the sum of its proper divisors (156557395260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56906361540 is a wasteful number, since it uses less digits than its factorization.
56906361540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1832 (or 1824 counting only the distinct ones).
The product of its (nonzero) digits is 583200, while the sum is 45.
The spelling of 56906361540 in words is "fifty-six billion, nine hundred six million, three hundred sixty-one thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •