Base | Representation |
---|---|
bin | 10101000110110001… |
… | …10000100011011101 |
3 | 1002020200111002022201 |
4 | 22203120300203131 |
5 | 141201231024013 |
6 | 5112213011501 |
7 | 550536566266 |
oct | 124330604335 |
9 | 32220432281 |
10 | 11331111133 |
11 | 4895131561 |
12 | 2242923b91 |
13 | 10b76c90b4 |
14 | 796c6196d |
15 | 464b963dd |
hex | 2a36308dd |
11331111133 has 6 divisors (see below), whose sum is σ = 12036855386. Its totient is φ = 10664574912.
The previous prime is 11331111131. The next prime is 11331111157. The reversal of 11331111133 is 33111113311.
It can be written as a sum of positive squares in 3 ways, for example, as 8342630244 + 2988480889 = 91338^2 + 54667^2 .
It is not a de Polignac number, because 11331111133 - 21 = 11331111131 is a prime.
It is a Duffinian number.
It is a zygodrome in base 10.
It is a self number, because there is not a number n which added to its sum of digits gives 11331111133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331111131) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 19603710 + ... + 19604287.
Almost surely, 211331111133 is an apocalyptic number.
It is an amenable number.
11331111133 is a deficient number, since it is larger than the sum of its proper divisors (705744253).
11331111133 is an equidigital number, since it uses as much as digits as its factorization.
11331111133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39208031 (or 39208014 counting only the distinct ones).
The product of its digits is 81, while the sum is 19.
Adding to 11331111133 its reverse (33111113311), we get a palindrome (44442224444).
It can be divided in two parts, 11 and 331111133, that multiplied together give a palindrome (3642222463).
The spelling of 11331111133 in words is "eleven billion, three hundred thirty-one million, one hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •