Base | Representation |
---|---|
bin | 10000001010111110101… |
… | …001100000001011101101 |
3 | 10221020110102012222210101 |
4 | 100022332221200023231 |
5 | 121201420312110013 |
6 | 2210305122111101 |
7 | 143201024050540 |
oct | 20127651401355 |
9 | 3836412188711 |
10 | 1111300113133 |
11 | 399332a40271 |
12 | 15b4641ab491 |
13 | 80a44c40052 |
14 | 3bb0417a857 |
15 | 1dd92a728dd |
hex | 102bea602ed |
1111300113133 has 32 divisors (see below), whose sum is σ = 1291276083200. Its totient is φ = 936710925696.
The previous prime is 1111300113107. The next prime is 1111300113193. The reversal of 1111300113133 is 3313110031111.
It is not a de Polignac number, because 1111300113133 - 217 = 1111299982061 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1111300113133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111300113193) 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, 290686060 + ... + 290689882.
It is an arithmetic number, because the mean of its divisors is an integer number (40352377600).
Almost surely, 21111300113133 is an apocalyptic number.
It is an amenable number.
1111300113133 is a deficient number, since it is larger than the sum of its proper divisors (179975970067).
1111300113133 is an equidigital number, since it uses as much as digits as its factorization.
1111300113133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5441.
The product of its (nonzero) digits is 81, while the sum is 19.
Adding to 1111300113133 its reverse (3313110031111), we get a palindrome (4424410144244).
The spelling of 1111300113133 in words is "one trillion, one hundred eleven billion, three hundred million, one hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •