Base | Representation |
---|---|
bin | 1010000100011110110111… |
… | …1001111100001010010011 |
3 | 1110012111002020010111200022 |
4 | 2201013231321330022103 |
5 | 2422401201230014421 |
6 | 35314243534414055 |
7 | 2221635336046352 |
oct | 241075571741223 |
9 | 43174066114608 |
10 | 11072122110611 |
11 | 358972a311101 |
12 | 12a9a2736132b |
13 | 6241343cb553 |
14 | 2a3c71d51999 |
15 | 14302824d7ab |
hex | a11ede7c293 |
11072122110611 has 8 divisors (see below), whose sum is σ = 11471247613200. Its totient is φ = 10674151820640.
The previous prime is 11072122110589. The next prime is 11072122110617. The reversal of 11072122110611 is 11601122127011.
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 11072122110611 - 218 = 11072121848467 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11072122110617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 288783641 + ... + 288821978.
It is an arithmetic number, because the mean of its divisors is an integer number (1433905951650).
Almost surely, 211072122110611 is an apocalyptic number.
11072122110611 is a deficient number, since it is larger than the sum of its proper divisors (399125502589).
11072122110611 is an equidigital number, since it uses as much as digits as its factorization.
11072122110611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 577606309.
The product of its (nonzero) digits is 336, while the sum is 26.
Adding to 11072122110611 its reverse (11601122127011), we get a palindrome (22673244237622).
The spelling of 11072122110611 in words is "eleven trillion, seventy-two billion, one hundred twenty-two million, one hundred ten thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •