Base | Representation |
---|---|
bin | 1010001000000010000111… |
… | …0010100011110001110111 |
3 | 1110102022112102102201101220 |
4 | 2202000201302203301313 |
5 | 2424401113231224421 |
6 | 35402252524521423 |
7 | 2226225100510506 |
oct | 242004162436167 |
9 | 43368472381356 |
10 | 11133122133111 |
11 | 3602592227940 |
12 | 12b98100b0273 |
13 | 629b060a2c14 |
14 | 2a6bbb55a83d |
15 | 1448e86893c6 |
hex | a2021ca3c77 |
11133122133111 has 32 divisors (see below), whose sum is σ = 16355665414656. Its totient is φ = 6679846800000.
The previous prime is 11133122133109. The next prime is 11133122133151.
11133122133111 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 11133122133111 - 21 = 11133122133109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11133122133151) 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, 32831350 + ... + 33168716.
It is an arithmetic number, because the mean of its divisors is an integer number (511114544208).
Almost surely, 211133122133111 is an apocalyptic number.
11133122133111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11133122133111 is a deficient number, since it is larger than the sum of its proper divisors (5222543281545).
11133122133111 is a wasteful number, since it uses less digits than its factorization.
11133122133111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347383.
The product of its digits is 324, while the sum is 24.
It can be divided in two parts, 1113312 and 2133111, that added together give a palindrome (3246423).
The spelling of 11133122133111 in words is "eleven trillion, one hundred thirty-three billion, one hundred twenty-two million, one hundred thirty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •