Base | Representation |
---|---|
bin | 101001001110011101011… |
… | …1011111101101100011110 |
3 | 202001200001210221102100202 |
4 | 1102130322323331230132 |
5 | 1220313032432124100 |
6 | 20014540413423502 |
7 | 1123234005653315 |
oct | 122347273755436 |
9 | 22050053842322 |
10 | 5666050661150 |
11 | 1894a5a980420 |
12 | 776150a9ab92 |
13 | 3213c9ba4a09 |
14 | 158349d1927c |
15 | 9c5c10d57d5 |
hex | 5273aefdb1e |
5666050661150 has 48 divisors (see below), whose sum is σ = 11497289126400. Its totient is φ = 2060318037600.
The previous prime is 5666050661123. The next prime is 5666050661177. The reversal of 5666050661150 is 511660506665.
It is an interprime number because it is at equal distance from previous prime (5666050661123) and next prime (5666050661177).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5666050661095 and 5666050661104.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19822547 + ... + 20106353.
It is an arithmetic number, because the mean of its divisors is an integer number (239526856800).
Almost surely, 25666050661150 is an apocalyptic number.
5666050661150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5666050661150 is an abundant number, since it is smaller than the sum of its proper divisors (5831238465250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5666050661150 is a wasteful number, since it uses less digits than its factorization.
5666050661150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320129 (or 320124 counting only the distinct ones).
The product of its (nonzero) digits is 972000, while the sum is 47.
The spelling of 5666050661150 in words is "five trillion, six hundred sixty-six billion, fifty million, six hundred sixty-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •