Base | Representation |
---|---|
bin | 110011101100011010… |
… | …1111110100110011101 |
3 | 101121112122001121222010 |
4 | 1213120311332212131 |
5 | 3304323111223401 |
6 | 122555344541433 |
7 | 11006662140141 |
oct | 1473065764635 |
9 | 347478047863 |
10 | 111012211101 |
11 | 43097554310 |
12 | 19621921879 |
13 | a61212119c |
14 | 55317cd221 |
15 | 2d4addbed6 |
hex | 19d8d7e99d |
111012211101 has 16 divisors (see below), whose sum is σ = 161488793088. Its totient is φ = 67273258800.
The previous prime is 111012211097. The next prime is 111012211109. The reversal of 111012211101 is 101112210111.
It is not a de Polignac number, because 111012211101 - 22 = 111012211097 is a prime.
It is a super-2 number, since 2×1110122111012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111012211109) 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 15 ways as a sum of consecutive naturals, for example, 166320 + ... + 499686.
It is an arithmetic number, because the mean of its divisors is an integer number (10093049568).
Almost surely, 2111012211101 is an apocalyptic number.
111012211101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
111012211101 is a deficient number, since it is larger than the sum of its proper divisors (50476581987).
111012211101 is a wasteful number, since it uses less digits than its factorization.
111012211101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343472.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 111012211101 its reverse (101112210111), we get a palindrome (212124421212).
The spelling of 111012211101 in words is "one hundred eleven billion, twelve million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •