Base | Representation |
---|---|
bin | 110011110101010011… |
… | …0110000110000000101 |
3 | 101122022101210122111012 |
4 | 1213222212300300011 |
5 | 3310430403241401 |
6 | 123045112052005 |
7 | 11020241122544 |
oct | 1475246606005 |
9 | 348271718435 |
10 | 111310212101 |
11 | 4322a792930 |
12 | 196a5694005 |
13 | a65ba9c13a |
14 | 555d20215b |
15 | 2d671538bb |
hex | 19ea9b0c05 |
111310212101 has 16 divisors (see below), whose sum is σ = 122431315968. Its totient is φ = 100356706800.
The previous prime is 111310212073. The next prime is 111310212109. The reversal of 111310212101 is 101212013111.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111310212101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111310212109) 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 15 ways as a sum of consecutive naturals, for example, 4125866 + ... + 4152756.
It is an arithmetic number, because the mean of its divisors is an integer number (7651957248).
Almost surely, 2111310212101 is an apocalyptic number.
111310212101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
111310212101 is a deficient number, since it is larger than the sum of its proper divisors (11121103867).
111310212101 is a wasteful number, since it uses less digits than its factorization.
111310212101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29992.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 111310212101 its reverse (101212013111), we get a palindrome (212522225212).
The spelling of 111310212101 in words is "one hundred eleven billion, three hundred ten million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •