Base | Representation |
---|---|
bin | 110011101111111110… |
… | …0010011110000011101 |
3 | 101121211221011112111102 |
4 | 1213133330103300131 |
5 | 3310044103424013 |
6 | 123015241402445 |
7 | 11012636362433 |
oct | 1473774236035 |
9 | 347757145442 |
10 | 111131311133 |
11 | 43148800997 |
12 | 19655799425 |
13 | a6309c158b |
14 | 5543552d53 |
15 | 2d565b5d58 |
hex | 19dff13c1d |
111131311133 has 32 divisors (see below), whose sum is σ = 122891787360. Its totient is φ = 100024852480.
The previous prime is 111131311129. The next prime is 111131311139. The reversal of 111131311133 is 331113131111.
It is a happy number.
It can be written as a sum of positive squares in 16 ways, for example, as 121066009 + 111010245124 = 11003^2 + 333182^2 .
It is a cyclic number.
It is not a de Polignac number, because 111131311133 - 22 = 111131311129 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111131311139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23963891 + ... + 23968527.
It is an arithmetic number, because the mean of its divisors is an integer number (3840368355).
Almost surely, 2111131311133 is an apocalyptic number.
It is an amenable number.
111131311133 is a deficient number, since it is larger than the sum of its proper divisors (11760476227).
111131311133 is a wasteful number, since it uses less digits than its factorization.
111131311133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5137.
The product of its digits is 81, while the sum is 20.
Adding to 111131311133 its reverse (331113131111), we get a palindrome (442244442244).
The spelling of 111131311133 in words is "one hundred eleven billion, one hundred thirty-one million, three hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •