Base | Representation |
---|---|
bin | 110011110010010100… |
… | …0011111101001000011 |
3 | 101122001102020111110102 |
4 | 1213210220133221003 |
5 | 3310224230044021 |
6 | 123031132153015 |
7 | 11014613300012 |
oct | 1474450375103 |
9 | 348042214412 |
10 | 111210003011 |
11 | 431891692a8 |
12 | 1967800876b |
13 | a6440b4413 |
14 | 554db98a79 |
15 | 2d5d45c00b |
hex | 19e4a1fa43 |
111210003011 has 12 divisors (see below), whose sum is σ = 118170297552. Its totient is φ = 104638363008.
The previous prime is 111210002999. The next prime is 111210003031. The reversal of 111210003011 is 110300012111.
It is a happy number.
It is not a de Polignac number, because 111210003011 - 218 = 111209740867 is a prime.
It is a super-2 number, since 2×1112100030112 (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 = 111210002983 and 111210003001.
It is not an unprimeable number, because it can be changed into a prime (111210003031) 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 11 ways as a sum of consecutive naturals, for example, 993941 + ... + 1100153.
It is an arithmetic number, because the mean of its divisors is an integer number (9847524796).
Almost surely, 2111210003011 is an apocalyptic number.
111210003011 is a deficient number, since it is larger than the sum of its proper divisors (6960294541).
111210003011 is a wasteful number, since it uses less digits than its factorization.
111210003011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109870 (or 109853 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 111210003011 its reverse (110300012111), we get a palindrome (221510015122).
The spelling of 111210003011 in words is "one hundred eleven billion, two hundred ten million, three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •