Base | Representation |
---|---|
bin | 110011101111001100… |
… | …1001000000110010001 |
3 | 101121210010020121012000 |
4 | 1213132121020012101 |
5 | 3310020424423441 |
6 | 123012512224213 |
7 | 11012202363600 |
oct | 1473631100621 |
9 | 347703217160 |
10 | 111105311121 |
11 | 43135062782 |
12 | 19648b3b069 |
13 | a6284ba15c |
14 | 553dd05a37 |
15 | 2d5417c2b6 |
hex | 19de648191 |
111105311121 has 48 divisors (see below), whose sum is σ = 192759408000. Its totient is φ = 63062538336.
The previous prime is 111105311101. The next prime is 111105311143. The reversal of 111105311121 is 121113501111.
111105311121 is a `hidden beast` number, since 1 + 1 + 1 + 10 + 531 + 1 + 121 = 666.
It is not a de Polignac number, because 111105311121 - 226 = 111038202257 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111105311094 and 111105311103.
It is not an unprimeable number, because it can be changed into a prime (111105311101) 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 47 ways as a sum of consecutive naturals, for example, 84685 + ... + 478938.
It is an arithmetic number, because the mean of its divisors is an integer number (4015821000).
Almost surely, 2111105311121 is an apocalyptic number.
It is an amenable number.
111105311121 is a deficient number, since it is larger than the sum of its proper divisors (81654096879).
111105311121 is a wasteful number, since it uses less digits than its factorization.
111105311121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563795 (or 563782 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 18.
Adding to 111105311121 its reverse (121113501111), we get a palindrome (232218812232).
The spelling of 111105311121 in words is "one hundred eleven billion, one hundred five million, three hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •