Base | Representation |
---|---|
bin | 110100101111010011… |
… | …101001111001100101 |
3 | 12102011112001111000001 |
4 | 310233103221321211 |
5 | 1411433313200412 |
6 | 42003100021301 |
7 | 4043205144211 |
oct | 645723517145 |
9 | 172145044001 |
10 | 56628256357 |
11 | 2201a1a1172 |
12 | ab84831831 |
13 | 54560487ca |
14 | 2a52b5d941 |
15 | 171672c957 |
hex | d2f4e9e65 |
56628256357 has 4 divisors (see below), whose sum is σ = 58454974336. Its totient is φ = 54801538380.
The previous prime is 56628256319. The next prime is 56628256403. The reversal of 56628256357 is 75365282665.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 56628256357 - 27 = 56628256229 is a prime.
It is a super-2 number, since 2×566282563572 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56628256298 and 56628256307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56625256357) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 913358943 + ... + 913359004.
It is an arithmetic number, because the mean of its divisors is an integer number (14613743584).
Almost surely, 256628256357 is an apocalyptic number.
It is an amenable number.
56628256357 is a deficient number, since it is larger than the sum of its proper divisors (1826717979).
56628256357 is a wasteful number, since it uses less digits than its factorization.
56628256357 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1826717978.
The product of its digits is 18144000, while the sum is 55.
The spelling of 56628256357 in words is "fifty-six billion, six hundred twenty-eight million, two hundred fifty-six thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •