Base | Representation |
---|---|
bin | 10011110111100111… |
… | …10100100001110101 |
3 | 1000112102001200010212 |
4 | 21323303310201311 |
5 | 133321240213121 |
6 | 4522253155205 |
7 | 525224665325 |
oct | 117363644165 |
9 | 30472050125 |
10 | 10667116661 |
11 | 45843446a3 |
12 | 209848bb05 |
13 | 100cc85366 |
14 | 7329bb285 |
15 | 42673725b |
hex | 27bcf4875 |
10667116661 has 4 divisors (see below), whose sum is σ = 11034948300. Its totient is φ = 10299285024.
The previous prime is 10667116651. The next prime is 10667116693. The reversal of 10667116661 is 16661176601.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16661176601 = 41 ⋅406370161.
It can be written as a sum of positive squares in 2 ways, for example, as 3539536036 + 7127580625 = 59494^2 + 84425^2 .
It is a cyclic number.
It is not a de Polignac number, because 10667116661 - 214 = 10667100277 is a prime.
It is a super-2 number, since 2×106671166612 (a number of 21 digits) contains 22 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 (10667116631) 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, 183915776 + ... + 183915833.
It is an arithmetic number, because the mean of its divisors is an integer number (2758737075).
Almost surely, 210667116661 is an apocalyptic number.
It is an amenable number.
10667116661 is a deficient number, since it is larger than the sum of its proper divisors (367831639).
10667116661 is an equidigital number, since it uses as much as digits as its factorization.
10667116661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 367831638.
The product of its (nonzero) digits is 54432, while the sum is 41.
The spelling of 10667116661 in words is "ten billion, six hundred sixty-seven million, one hundred sixteen thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •