Base | Representation |
---|---|
bin | 110011110101100110… |
… | …0011110110101110011 |
3 | 101122100002102000102111 |
4 | 1213223030132311303 |
5 | 3310440421201321 |
6 | 123050104030151 |
7 | 11020421145055 |
oct | 1475314366563 |
9 | 348302360374 |
10 | 111320100211 |
11 | 43235326a21 |
12 | 196a8a62357 |
13 | a660b51aa8 |
14 | 55606578d5 |
15 | 2d67e585e1 |
hex | 19eb31ed73 |
111320100211 has 8 divisors (see below), whose sum is σ = 117893839104. Its totient is φ = 104890839240.
The previous prime is 111320100169. The next prime is 111320100271. The reversal of 111320100211 is 112001023111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111320100211 - 225 = 111286545779 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111320100191 and 111320100200.
It is not an unprimeable number, because it can be changed into a prime (111320100271) 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 7 ways as a sum of consecutive naturals, for example, 36117895 + ... + 36120976.
It is an arithmetic number, because the mean of its divisors is an integer number (14736729888).
Almost surely, 2111320100211 is an apocalyptic number.
111320100211 is a deficient number, since it is larger than the sum of its proper divisors (6573738893).
111320100211 is an equidigital number, since it uses as much as digits as its factorization.
111320100211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72238961.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 111320100211 its reverse (112001023111), we get a palindrome (223321123322).
The spelling of 111320100211 in words is "one hundred eleven billion, three hundred twenty million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •