Base | Representation |
---|---|
bin | 1010001000000010000110… |
… | …1010100000011011000011 |
3 | 1110102022112021110110210102 |
4 | 2202000201222200123003 |
5 | 2424401112211202321 |
6 | 35402252411353015 |
7 | 2226225043536335 |
oct | 242004152403303 |
9 | 43368467413712 |
10 | 11133120022211 |
11 | 36025910159a0 |
12 | 12b980b45276b |
13 | 629b05814175 |
14 | 2a6bbb16b455 |
15 | 1448e83bdc0b |
hex | a2021aa06c3 |
11133120022211 has 64 divisors (see below), whose sum is σ = 12624817766400. Its totient is φ = 9732063600000.
The previous prime is 11133120022187. The next prime is 11133120022307. The reversal of 11133120022211 is 11222002133111.
It is a cyclic number.
It is not a de Polignac number, because 11133120022211 - 26 = 11133120022147 is a prime.
It is a super-2 number, since 2×111331200222112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11133120042211) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1922483726 + ... + 1922489516.
It is an arithmetic number, because the mean of its divisors is an integer number (197262777600).
Almost surely, 211133120022211 is an apocalyptic number.
11133120022211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11133120022211 is a deficient number, since it is larger than the sum of its proper divisors (1491697744189).
11133120022211 is a wasteful number, since it uses less digits than its factorization.
11133120022211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6312.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11133120022211 its reverse (11222002133111), we get a palindrome (22355122155322).
The spelling of 11133120022211 in words is "eleven trillion, one hundred thirty-three billion, one hundred twenty million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •