Base | Representation |
---|---|
bin | 110100001001111010… |
… | …111011001010000010 |
3 | 12100112210210101121101 |
4 | 310021322323022002 |
5 | 1404142230011300 |
6 | 41420532045014 |
7 | 4021520533351 |
oct | 641172731202 |
9 | 170483711541 |
10 | 56001016450 |
11 | 21828128585 |
12 | aa2a76376a |
13 | 5386103332 |
14 | 29d3725998 |
15 | 16cb62db6a |
hex | d09ebb282 |
56001016450 has 48 divisors (see below), whose sum is σ = 108451886760. Its totient is φ = 21495744000.
The previous prime is 56001016441. The next prime is 56001016507. The reversal of 56001016450 is 5461010065.
It can be written as a sum of positive squares in 12 ways, for example, as 17074910241 + 38926106209 = 130671^2 + 197297^2 .
It is a super-3 number, since 3×560010164503 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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, 98865 + ... + 348964.
Almost surely, 256001016450 is an apocalyptic number.
56001016450 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56001016450 is a deficient number, since it is larger than the sum of its proper divisors (52450870310).
56001016450 is a wasteful number, since it uses less digits than its factorization.
56001016450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 447943 (or 447938 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 28.
The spelling of 56001016450 in words is "fifty-six billion, one million, sixteen thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •