Base | Representation |
---|---|
bin | 110100010111100111… |
… | …111000001010110100 |
3 | 12101010211100220201121 |
4 | 310113213320022310 |
5 | 1410130102421000 |
6 | 41455423233324 |
7 | 4030311542041 |
oct | 642747701264 |
9 | 171124326647 |
10 | 56230904500 |
11 | 21935974901 |
12 | aa93748844 |
13 | 53c1923674 |
14 | 2a160881c8 |
15 | 16e18ddb1a |
hex | d179f82b4 |
56230904500 has 24 divisors (see below), whose sum is σ = 122808296520. Its totient is φ = 22492361600.
The previous prime is 56230904497. The next prime is 56230904519. The reversal of 56230904500 is 540903265.
It can be written as a sum of positive squares in 4 ways, for example, as 15528648996 + 40702255504 = 124614^2 + 201748^2 .
It is a super-3 number, since 3×562309045003 (a number of 33 digits) contains 333 as substring.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 56230405 + ... + 56231404.
It is an arithmetic number, because the mean of its divisors is an integer number (5117012355).
Almost surely, 256230904500 is an apocalyptic number.
56230904500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
56230904500 is an abundant number, since it is smaller than the sum of its proper divisors (66577392020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56230904500 is a wasteful number, since it uses less digits than its factorization.
56230904500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112461828 (or 112461816 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 34.
The spelling of 56230904500 in words is "fifty-six billion, two hundred thirty million, nine hundred four thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •