Base | Representation |
---|---|
bin | 110100101011000010… |
… | …101101101000001101 |
3 | 12101222112102100210120 |
4 | 310223002231220031 |
5 | 1411312004100232 |
6 | 41552022255153 |
7 | 4041346033416 |
oct | 645302555015 |
9 | 171875370716 |
10 | 56556706317 |
11 | 21a92871601 |
12 | ab648874b9 |
13 | 54442865c7 |
14 | 2a4745680d |
15 | 17102e792c |
hex | d2b0ada0d |
56556706317 has 8 divisors (see below), whose sum is σ = 75410042400. Its totient is φ = 37703920560.
The previous prime is 56556706303. The next prime is 56556706361. The reversal of 56556706317 is 71360765565.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 56556706317 - 212 = 56556702221 is a prime.
It is a super-2 number, since 2×565567063172 (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 56556706317.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56556706387) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 313434 + ... + 459732.
It is an arithmetic number, because the mean of its divisors is an integer number (9426255300).
Almost surely, 256556706317 is an apocalyptic number.
It is an amenable number.
56556706317 is a deficient number, since it is larger than the sum of its proper divisors (18853336083).
56556706317 is a wasteful number, since it uses less digits than its factorization.
56556706317 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275163.
The product of its (nonzero) digits is 3969000, while the sum is 51.
The spelling of 56556706317 in words is "fifty-six billion, five hundred fifty-six million, seven hundred six thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •