Base | Representation |
---|---|
bin | 10100101100000000… |
… | …10100011010011001 |
3 | 1001200001000202202211 |
4 | 22112000110122121 |
5 | 140221242204401 |
6 | 5034032555121 |
7 | 542142355525 |
oct | 122600243231 |
9 | 31601022684 |
10 | 11106600601 |
11 | 478a428468 |
12 | 219b6b2aa1 |
13 | 108003c625 |
14 | 7750dcd85 |
15 | 4500e9951 |
hex | 296014699 |
11106600601 has 4 divisors (see below), whose sum is σ = 11108455552. Its totient is φ = 11104745652.
The previous prime is 11106600581. The next prime is 11106600619. The reversal of 11106600601 is 10600660111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 10600660111 = 3877 ⋅2734243.
It is a cyclic number.
It is not a de Polignac number, because 11106600601 - 27 = 11106600473 is a prime.
It is a super-2 number, since 2×111066006012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11106600101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 918465 + ... + 930478.
It is an arithmetic number, because the mean of its divisors is an integer number (2777113888).
Almost surely, 211106600601 is an apocalyptic number.
It is an amenable number.
11106600601 is a deficient number, since it is larger than the sum of its proper divisors (1854951).
11106600601 is an equidigital number, since it uses as much as digits as its factorization.
11106600601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1854950.
The product of its (nonzero) digits is 216, while the sum is 22.
The spelling of 11106600601 in words is "eleven billion, one hundred six million, six hundred thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •