Base | Representation |
---|---|
bin | 110100111001111010… |
… | …100001100000011010 |
3 | 12102121220220212010220 |
4 | 310321322201200122 |
5 | 1412314342432004 |
6 | 42032454220510 |
7 | 4050465612126 |
oct | 647172414032 |
9 | 172556825126 |
10 | 56806217754 |
11 | 221006a1200 |
12 | b014354736 |
13 | 5483b87800 |
14 | 2a6c646586 |
15 | 1727181dd9 |
hex | d39ea181a |
56806217754 has 144 divisors (see below), whose sum is σ = 137150459712. Its totient is φ = 15663648000.
The previous prime is 56806217753. The next prime is 56806217773. The reversal of 56806217754 is 45771260865.
It is a junction number, because it is equal to n+sod(n) for n = 56806217697 and 56806217706.
It is not an unprimeable number, because it can be changed into a prime (56806217753) by changing a digit.
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 71 ways as a sum of consecutive naturals, for example, 8708014 + ... + 8714534.
It is an arithmetic number, because the mean of its divisors is an integer number (952433748).
Almost surely, 256806217754 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56806217754, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68575229856).
56806217754 is an abundant number, since it is smaller than the sum of its proper divisors (80344241958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56806217754 is a wasteful number, since it uses less digits than its factorization.
56806217754 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6645 (or 6621 counting only the distinct ones).
The product of its (nonzero) digits is 2822400, while the sum is 51.
The spelling of 56806217754 in words is "fifty-six billion, eight hundred six million, two hundred seventeen thousand, seven hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •