Base | Representation |
---|---|
bin | 101001001110100101100… |
… | …1100011100100110011100 |
3 | 202001200202211011212201210 |
4 | 1102131023030130212130 |
5 | 1220314112243330000 |
6 | 20015023435504420 |
7 | 1123243530234324 |
oct | 122351314344634 |
9 | 22050684155653 |
10 | 5666323417500 |
11 | 189508a937299 |
12 | 7762082b8110 |
13 | 3214415542c5 |
14 | 15837423a284 |
15 | 9c5da012350 |
hex | 5274b31c99c |
5666323417500 has 120 divisors (see below), whose sum is σ = 16582458914560. Its totient is φ = 1505443320000.
The previous prime is 5666323417499. The next prime is 5666323417571. The reversal of 5666323417500 is 57143236665.
It is a self number, because there is not a number n which added to its sum of digits gives 5666323417500.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 638571 + ... + 3426429.
Almost surely, 25666323417500 is an apocalyptic number.
5666323417500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5666323417500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8291229457280).
5666323417500 is an abundant number, since it is smaller than the sum of its proper divisors (10916135497060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5666323417500 is a wasteful number, since it uses less digits than its factorization.
5666323417500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2788157 (or 2788140 counting only the distinct ones).
The product of its (nonzero) digits is 2721600, while the sum is 48.
The spelling of 5666323417500 in words is "five trillion, six hundred sixty-six billion, three hundred twenty-three million, four hundred seventeen thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •