Base | Representation |
---|---|
bin | 1010000000111111010110… |
… | …1000000100100101011111 |
3 | 1102222202012201112021021021 |
4 | 2200033311220010211133 |
5 | 2420410311224231421 |
6 | 35230522110145011 |
7 | 2214412436305024 |
oct | 240176550044537 |
9 | 42882181467237 |
10 | 11012122102111 |
11 | 356623a928719 |
12 | 129a2814b2167 |
13 | 61b59196a540 |
14 | 2a0dbd49954b |
15 | 1416b59e8341 |
hex | a03f5a0495f |
11012122102111 has 8 divisors (see below), whose sum is σ = 11859302632464. Its totient is φ = 10164955031040.
The previous prime is 11012122102081. The next prime is 11012122102129. The reversal of 11012122102111 is 11120122121011.
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 11012122102111 - 213 = 11012122093919 is a prime.
It is a super-3 number, since 3×110121221021113 (a number of 40 digits) contains 333 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 (11012122102141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1632481 + ... + 4968826.
It is an arithmetic number, because the mean of its divisors is an integer number (1482412829058).
Almost surely, 211012122102111 is an apocalyptic number.
11012122102111 is a deficient number, since it is larger than the sum of its proper divisors (847180530353).
11012122102111 is a wasteful number, since it uses less digits than its factorization.
11012122102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6729641.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 11012122102111 its reverse (11120122121011), we get a palindrome (22132244223122).
The spelling of 11012122102111 in words is "eleven trillion, twelve billion, one hundred twenty-two million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •