Base | Representation |
---|---|
bin | 110011110010000001… |
… | …0010101100011010011 |
3 | 101122000201102022012100 |
4 | 1213210002111203103 |
5 | 3310214200001321 |
6 | 123030133531443 |
7 | 11014432256226 |
oct | 1474402254323 |
9 | 348021368170 |
10 | 111200000211 |
11 | 43183557023 |
12 | 196747a3b83 |
13 | a641cc14c1 |
14 | 554c7135bd |
15 | 2d5c633326 |
hex | 19e40958d3 |
111200000211 has 48 divisors (see below), whose sum is σ = 175941013248. Its totient is φ = 67374028800.
The previous prime is 111200000189. The next prime is 111200000227. The reversal of 111200000211 is 112000002111.
It is a happy number.
It is not a de Polignac number, because 111200000211 - 25 = 111200000179 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 111200000193 and 111200000202.
It is not an unprimeable number, because it can be changed into a prime (111200000251) 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 47 ways as a sum of consecutive naturals, for example, 2161095 + ... + 2211951.
It is an arithmetic number, because the mean of its divisors is an integer number (3665437776).
Almost surely, 2111200000211 is an apocalyptic number.
111200000211 is a deficient number, since it is larger than the sum of its proper divisors (64741013037).
111200000211 is a wasteful number, since it uses less digits than its factorization.
111200000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51372 (or 51369 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 111200000211 its reverse (112000002111), we get a palindrome (223200002322).
The spelling of 111200000211 in words is "one hundred eleven billion, two hundred million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •