Base | Representation |
---|---|
bin | 1010000000010110010111… |
… | …1010001111001000110111 |
3 | 1102221200211001000220020212 |
4 | 2200011211322033020313 |
5 | 2420220243434311411 |
6 | 35221502322420035 |
7 | 2213543014463612 |
oct | 240054572171067 |
9 | 42850731026225 |
10 | 11001121010231 |
11 | 3561605014550 |
12 | 129811120161b |
13 | 61a52a74cc11 |
14 | 2a06583c3179 |
15 | 14126ece068b |
hex | a0165e8f237 |
11001121010231 has 16 divisors (see below), whose sum is σ = 12310090352640. Its totient is φ = 9745487986080.
The previous prime is 11001121010189. The next prime is 11001121010251. The reversal of 11001121010231 is 13201012110011.
It is a de Polignac number, because none of the positive numbers 2k-11001121010231 is a prime.
It is a super-2 number, since 2×110011210102312 (a number of 27 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 (11001121010251) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46341791 + ... + 46578576.
It is an arithmetic number, because the mean of its divisors is an integer number (769380647040).
Almost surely, 211001121010231 is an apocalyptic number.
11001121010231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11001121010231 is a deficient number, since it is larger than the sum of its proper divisors (1308969342409).
11001121010231 is a wasteful number, since it uses less digits than its factorization.
11001121010231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92920654.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 11001121010231 its reverse (13201012110011), we get a palindrome (24202133120242).
The spelling of 11001121010231 in words is "eleven trillion, one billion, one hundred twenty-one million, ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •