Base | Representation |
---|---|
bin | 10000010000000000110… |
… | …111100110010001101101 |
3 | 10221202102011111010202121 |
4 | 100100000313212101231 |
5 | 121244003223243121 |
6 | 2213001354352541 |
7 | 143452005664555 |
oct | 20200067462155 |
9 | 3852364433677 |
10 | 1116706071661 |
11 | 3a0657512994 |
12 | 16051272b751 |
13 | 813c6c1838b |
14 | 3c098114165 |
15 | 1e0ac468141 |
hex | 10400de646d |
1116706071661 has 4 divisors (see below), whose sum is σ = 1117642121532. Its totient is φ = 1115770021792.
The previous prime is 1116706071629. The next prime is 1116706071683. The reversal of 1116706071661 is 1661706076111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 592254915561 + 524451156100 = 769581^2 + 724190^2 .
It is a cyclic number.
It is not a de Polignac number, because 1116706071661 - 25 = 1116706071629 is a prime.
It is a super-3 number, since 3×11167060716613 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1116706071161) 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, 468023146 + ... + 468025531.
It is an arithmetic number, because the mean of its divisors is an integer number (279410530383).
Almost surely, 21116706071661 is an apocalyptic number.
It is an amenable number.
1116706071661 is a deficient number, since it is larger than the sum of its proper divisors (936049871).
1116706071661 is an equidigital number, since it uses as much as digits as its factorization.
1116706071661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 936049870.
The product of its (nonzero) digits is 63504, while the sum is 43.
The spelling of 1116706071661 in words is "one trillion, one hundred sixteen billion, seven hundred six million, seventy-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •