Base | Representation |
---|---|
bin | 10000010101000011000… |
… | …101111101101010010011 |
3 | 10222021100220212212212212 |
4 | 100111003011331222103 |
5 | 121341041144213021 |
6 | 2215254032342335 |
7 | 144032661325226 |
oct | 20250305755223 |
9 | 3867326785785 |
10 | 1122112101011 |
11 | 3a2981033840 |
12 | 1615810a49ab |
13 | 81a78c19a05 |
14 | 3c44c0a95bd |
15 | 1e2c6d7485b |
hex | 1054317da93 |
1122112101011 has 8 divisors (see below), whose sum is σ = 1225330717104. Its totient is φ = 1019094889120.
The previous prime is 1122112101007. The next prime is 1122112101049. The reversal of 1122112101011 is 1101012112211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1122112101011 - 22 = 1122112101007 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1122112101211) 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 7 ways as a sum of consecutive naturals, for example, 50339396 + ... + 50361681.
It is an arithmetic number, because the mean of its divisors is an integer number (153166339638).
Almost surely, 21122112101011 is an apocalyptic number.
1122112101011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1122112101011 is a deficient number, since it is larger than the sum of its proper divisors (103218616093).
1122112101011 is a wasteful number, since it uses less digits than its factorization.
1122112101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100702101.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 1122112101011 its reverse (1101012112211), we get a palindrome (2223124213222).
The spelling of 1122112101011 in words is "one trillion, one hundred twenty-two billion, one hundred twelve million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •