Base | Representation |
---|---|
bin | 1010000111010001010001… |
… | …1000100110000011110011 |
3 | 1110101001200210000021001121 |
4 | 2201310110120212003303 |
5 | 2424142241123233021 |
6 | 35352244012043111 |
7 | 2225252162113126 |
oct | 241642430460363 |
9 | 43331623007047 |
10 | 11120012321011 |
11 | 35a7a75069a90 |
12 | 12b7171763497 |
13 | 6287c7033559 |
14 | 2a62d63a83bd |
15 | 1443cc795741 |
hex | a1d146260f3 |
11120012321011 has 32 divisors (see below), whose sum is σ = 12990300353280. Its totient is φ = 9411642979200.
The previous prime is 11120012321009. The next prime is 11120012321029. The reversal of 11120012321011 is 11012321002111.
It is a happy number.
It is not a de Polignac number, because 11120012321011 - 21 = 11120012321009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11120012321051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13928781 + ... + 14705473.
It is an arithmetic number, because the mean of its divisors is an integer number (405946886040).
Almost surely, 211120012321011 is an apocalyptic number.
11120012321011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11120012321011 is a deficient number, since it is larger than the sum of its proper divisors (1870288032269).
11120012321011 is a wasteful number, since it uses less digits than its factorization.
11120012321011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 777907.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 11120012321011 its reverse (11012321002111), we get a palindrome (22132333323122).
The spelling of 11120012321011 in words is "eleven trillion, one hundred twenty billion, twelve million, three hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •