Base | Representation |
---|---|
bin | 10000111110000001111… |
… | …101011011010001111001 |
3 | 11010110221122220222221021 |
4 | 100332001331123101321 |
5 | 123101201311004401 |
6 | 2251412335342441 |
7 | 150151311465343 |
oct | 20760175332171 |
9 | 4113848828837 |
10 | 1166116500601 |
11 | 40a602400528 |
12 | 16a002081a21 |
13 | 85c6c7a1390 |
14 | 40624414293 |
15 | 205001a02a1 |
hex | 10f81f5b479 |
1166116500601 has 8 divisors (see below), whose sum is σ = 1255851127944. Its totient is φ = 1076386638720.
The previous prime is 1166116500587. The next prime is 1166116500649. The reversal of 1166116500601 is 1060056116611.
It can be written as a sum of positive squares in 4 ways, for example, as 203802588025 + 962313912576 = 451445^2 + 980976^2 .
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 1166116500601 - 215 = 1166116467833 is a prime.
It is a super-2 number, since 2×11661165006012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1166116500691) 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, 674836 + ... + 1669621.
It is an arithmetic number, because the mean of its divisors is an integer number (156981390993).
Almost surely, 21166116500601 is an apocalyptic number.
It is an amenable number.
1166116500601 is a deficient number, since it is larger than the sum of its proper divisors (89734627343).
1166116500601 is a wasteful number, since it uses less digits than its factorization.
1166116500601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2382731.
The product of its (nonzero) digits is 6480, while the sum is 34.
The spelling of 1166116500601 in words is "one trillion, one hundred sixty-six billion, one hundred sixteen million, five hundred thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •