Base | Representation |
---|---|
bin | 10100101011011110… |
… | …10001101110001101 |
3 | 1001122201121210120001 |
4 | 22111233101232031 |
5 | 140214121230013 |
6 | 5033353124301 |
7 | 542056401040 |
oct | 122557215615 |
9 | 31581553501 |
10 | 11102133133 |
11 | 4787956a43 |
12 | 219a0b9691 |
13 | 107c137060 |
14 | 774698c57 |
15 | 44ea15ddd |
hex | 295bd1b8d |
11102133133 has 16 divisors (see below), whose sum is σ = 14135345280. Its totient is φ = 8481203136.
The previous prime is 11102133103. The next prime is 11102133167. The reversal of 11102133133 is 33133120111.
It is not a de Polignac number, because 11102133133 - 233 = 2512198541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11102133133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102133103) 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 15 ways as a sum of consecutive naturals, for example, 2100835 + ... + 2106112.
It is an arithmetic number, because the mean of its divisors is an integer number (883459080).
Almost surely, 211102133133 is an apocalyptic number.
11102133133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11102133133 is a deficient number, since it is larger than the sum of its proper divisors (3033212147).
11102133133 is a wasteful number, since it uses less digits than its factorization.
11102133133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4206996.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 11102133133 its reverse (33133120111), we get a palindrome (44235253244).
The spelling of 11102133133 in words is "eleven billion, one hundred two million, one hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •