Base | Representation |
---|---|
bin | 110100010110101011… |
… | …101000010000101110 |
3 | 12101002201122111201010 |
4 | 310112223220100232 |
5 | 1410112032020302 |
6 | 41454100530050 |
7 | 4030030362012 |
oct | 642653502056 |
9 | 171081574633 |
10 | 56215110702 |
11 | 21927a67783 |
12 | aa8a3b0926 |
13 | 53bb58391a |
14 | 2a13d36542 |
15 | 16e031e16c |
hex | d16ae842e |
56215110702 has 8 divisors (see below), whose sum is σ = 112430221416. Its totient is φ = 18738370232.
The previous prime is 56215110683. The next prime is 56215110737. The reversal of 56215110702 is 20701151265.
It is a sphenic number, since it is the product of 3 distinct primes.
56215110702 is an admirable number.
It is a super-2 number, since 2×562151107022 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 56215110702.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 4684592553 + ... + 4684592564.
It is an arithmetic number, because the mean of its divisors is an integer number (14053777677).
Almost surely, 256215110702 is an apocalyptic number.
56215110702 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56215110702 is a wasteful number, since it uses less digits than its factorization.
56215110702 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9369185122.
The product of its (nonzero) digits is 4200, while the sum is 30.
Adding to 56215110702 its reverse (20701151265), we get a palindrome (76916261967).
The spelling of 56215110702 in words is "fifty-six billion, two hundred fifteen million, one hundred ten thousand, seven hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •