Base | Representation |
---|---|
bin | 1010000110001011101101… |
… | …1111111111110100100101 |
3 | 1110022021111120001001200212 |
4 | 2201202323133333310211 |
5 | 2423341021323021013 |
6 | 35335515153345205 |
7 | 2224021404301523 |
oct | 241427337776445 |
9 | 43267446031625 |
10 | 11101341220133 |
11 | 35a00637865aa |
12 | 12b3620868205 |
13 | 626b0ca71778 |
14 | 2a54447a7313 |
15 | 143b885276a8 |
hex | a18bb7ffd25 |
11101341220133 has 32 divisors (see below), whose sum is σ = 11730888322560. Its totient is φ = 10485145440000.
The previous prime is 11101341220129. The next prime is 11101341220153. The reversal of 11101341220133 is 33102214310111.
It is a cyclic number.
It is not a de Polignac number, because 11101341220133 - 22 = 11101341220129 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a junction number, because it is equal to n+sod(n) for n = 11101341220099 and 11101341220108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101341220153) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 328902008 + ... + 328935758.
It is an arithmetic number, because the mean of its divisors is an integer number (366590260080).
Almost surely, 211101341220133 is an apocalyptic number.
It is an amenable number.
11101341220133 is a deficient number, since it is larger than the sum of its proper divisors (629547102427).
11101341220133 is a wasteful number, since it uses less digits than its factorization.
11101341220133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34517.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11101341220133 its reverse (33102214310111), we get a palindrome (44203555530244).
The spelling of 11101341220133 in words is "eleven trillion, one hundred one billion, three hundred forty-one million, two hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •