Base | Representation |
---|---|
bin | 10100101111001011… |
… | …00010000101001101 |
3 | 1001201212221202120012 |
4 | 22113211202011031 |
5 | 140300040230013 |
6 | 5040421403005 |
7 | 542614033043 |
oct | 122745420515 |
9 | 31655852505 |
10 | 11133133133 |
11 | 47a33aa781 |
12 | 21a8569465 |
13 | 108569c255 |
14 | 778848393 |
15 | 4525db1a8 |
hex | 29796214d |
11133133133 has 8 divisors (see below), whose sum is σ = 11184057600. Its totient is φ = 11082245328.
The previous prime is 11133133127. The next prime is 11133133159. The reversal of 11133133133 is 33133133111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11133133133 - 28 = 11133132877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11133133099 and 11133133108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11133133103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 735560 + ... + 750542.
It is an arithmetic number, because the mean of its divisors is an integer number (1398007200).
Almost surely, 211133133133 is an apocalyptic number.
It is an amenable number.
11133133133 is a deficient number, since it is larger than the sum of its proper divisors (50924467).
11133133133 is a wasteful number, since it uses less digits than its factorization.
11133133133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18331.
The product of its digits is 729, while the sum is 23.
Adding to 11133133133 its reverse (33133133111), we get a palindrome (44266266244).
It can be divided in two parts, 111 and 33133133, that multiplied together give a palindrome (3677777763).
The spelling of 11133133133 in words is "eleven billion, one hundred thirty-three million, one hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •