Base | Representation |
---|---|
bin | 110011010001110111… |
… | …1000101010011100111 |
3 | 101112020112111010202111 |
4 | 1212203233011103213 |
5 | 3301012012223421 |
6 | 122331115421451 |
7 | 10645622564422 |
oct | 1464357052347 |
9 | 345215433674 |
10 | 110121211111 |
11 | 4277a60988a |
12 | 19413454887 |
13 | a4cc659162 |
14 | 54893369b9 |
15 | 2ce7a8bee1 |
hex | 19a3bc54e7 |
110121211111 has 8 divisors (see below), whose sum is σ = 110583536400. Its totient is φ = 109659385920.
The previous prime is 110121211097. The next prime is 110121211139. The reversal of 110121211111 is 111112121011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110121211111 is a prime.
It is a super-2 number, since 2×1101212111112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110121211091 and 110121211100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110121211141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 319605 + ... + 567793.
It is an arithmetic number, because the mean of its divisors is an integer number (13822942050).
Almost surely, 2110121211111 is an apocalyptic number.
110121211111 is a deficient number, since it is larger than the sum of its proper divisors (462325289).
110121211111 is a wasteful number, since it uses less digits than its factorization.
110121211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250049.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 110121211111 its reverse (111112121011), we get a palindrome (221233332122).
The spelling of 110121211111 in words is "one hundred ten billion, one hundred twenty-one million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •