Base | Representation |
---|---|
bin | 110011110011000000… |
… | …1000100000111111001 |
3 | 101122010000221002201010 |
4 | 1213212001010013321 |
5 | 3310301201033423 |
6 | 123033321544133 |
7 | 11015314531200 |
oct | 1474601040771 |
9 | 348100832633 |
10 | 111233221113 |
11 | 431a0287413 |
12 | 19683945049 |
13 | a648b53541 |
14 | 5552cc0237 |
15 | 2d604e6693 |
hex | 19e60441f9 |
111233221113 has 192 divisors, whose sum is σ = 190625218560. Its totient is φ = 57385036800.
The previous prime is 111233221087. The next prime is 111233221129. The reversal of 111233221113 is 311122332111.
It is not a de Polignac number, because 111233221113 - 25 = 111233221081 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 111233221113.
It is not an unprimeable number, because it can be changed into a prime (111233221213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 465410848 + ... + 465411086.
It is an arithmetic number, because the mean of its divisors is an integer number (992839680).
Almost surely, 2111233221113 is an apocalyptic number.
It is an amenable number.
111233221113 is a deficient number, since it is larger than the sum of its proper divisors (79391997447).
111233221113 is a wasteful number, since it uses less digits than its factorization.
111233221113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428 (or 421 counting only the distinct ones).
The product of its digits is 216, while the sum is 21.
Adding to 111233221113 its reverse (311122332111), we get a palindrome (422355553224).
The spelling of 111233221113 in words is "one hundred eleven billion, two hundred thirty-three million, two hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •