Base | Representation |
---|---|
bin | 11001110000001110001101… |
… | …00111100101101001110101 |
3 | 21102112000022121222212200022 |
4 | 30320013012213211221311 |
5 | 24410331302333024443 |
6 | 320240333401254525 |
7 | 14633363356654616 |
oct | 1470070647455165 |
9 | 242460277885608 |
10 | 56632476064373 |
11 | 17054775372960 |
12 | 6427905794445 |
13 | 257a55ba73bc1 |
14 | ddb0528a5c0d |
15 | 683219b3ce68 |
hex | 3381c69e5a75 |
56632476064373 has 8 divisors (see below), whose sum is σ = 65032508399520. Its totient is φ = 48774381299280.
The previous prime is 56632476064343. The next prime is 56632476064403. The reversal of 56632476064373 is 37346067423665.
It is an interprime number because it is at equal distance from previous prime (56632476064343) and next prime (56632476064403).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 56632476064373 - 216 = 56632475998837 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56632476064343) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 135484392290 + ... + 135484392707.
It is an arithmetic number, because the mean of its divisors is an integer number (8129063549940).
Almost surely, 256632476064373 is an apocalyptic number.
It is an amenable number.
56632476064373 is a deficient number, since it is larger than the sum of its proper divisors (8400032335147).
56632476064373 is a wasteful number, since it uses less digits than its factorization.
56632476064373 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 270968785027.
The product of its (nonzero) digits is 274337280, while the sum is 62.
The spelling of 56632476064373 in words is "fifty-six trillion, six hundred thirty-two billion, four hundred seventy-six million, sixty-four thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •