Base | Representation |
---|---|
bin | 101001001110011111011… |
… | …0001111110000010110110 |
3 | 202001200020022021210102220 |
4 | 1102130332301332002312 |
5 | 1220313200434300011 |
6 | 20014551035543210 |
7 | 1123235421054423 |
oct | 122347661760266 |
9 | 22050208253386 |
10 | 5666115150006 |
11 | 1894a933178a3 |
12 | 77616a5bab06 |
13 | 32140a363bbc |
14 | 158354704d4a |
15 | 9c5c6ac3506 |
hex | 5273ec7e0b6 |
5666115150006 has 8 divisors (see below), whose sum is σ = 11332230300024. Its totient is φ = 1888705050000.
The previous prime is 5666115150001. The next prime is 5666115150013. The reversal of 5666115150006 is 6000515116665.
It is a sphenic number, since it is the product of 3 distinct primes.
5666115150006 is an admirable number.
It is a super-3 number, since 3×56661151500063 (a number of 39 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5666115150006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5666115150001) 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, 472176262495 + ... + 472176262506.
It is an arithmetic number, because the mean of its divisors is an integer number (1416528787503).
Almost surely, 25666115150006 is an apocalyptic number.
5666115150006 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5666115150006 is a wasteful number, since it uses less digits than its factorization.
5666115150006 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 944352525006.
The product of its (nonzero) digits is 162000, while the sum is 42.
The spelling of 5666115150006 in words is "five trillion, six hundred sixty-six billion, one hundred fifteen million, one hundred fifty thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •