Base | Representation |
---|---|
bin | 110100010110001100… |
… | …011010001001000000 |
3 | 12101002011020200221211 |
4 | 310112030122021000 |
5 | 1410102433121100 |
6 | 41453205255504 |
7 | 4026600664042 |
oct | 642614321100 |
9 | 171064220854 |
10 | 56206926400 |
11 | 21923387799 |
12 | aa87704594 |
13 | 53b9979641 |
14 | 2a12c05a92 |
15 | 16de7541ba |
hex | d1631a240 |
56206926400 has 63 divisors (see below), whose sum is σ = 138327506809. Its totient is φ = 22478977280.
The previous prime is 56206926341. The next prime is 56206926427. The reversal of 56206926400 is 462960265.
The square root of 56206926400 is 237080.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 20234493504 + 35972432896 = 142248^2 + 189664^2 .
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 9480237 + ... + 9486163.
Almost surely, 256206926400 is an apocalyptic number.
56206926400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56206926400 is the 237080-th square number.
It is an amenable number.
56206926400 is an abundant number, since it is smaller than the sum of its proper divisors (82120580409).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56206926400 is an frugal number, since it uses more digits than its factorization.
56206926400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11876 (or 5934 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 40.
The spelling of 56206926400 in words is "fifty-six billion, two hundred six million, nine hundred twenty-six thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •