Base | Representation |
---|---|
bin | 1101001111000… |
… | …00100001000110 |
3 | 21201220101221122 |
4 | 12213200201012 |
5 | 211410120402 |
6 | 15003313542 |
7 | 2515440524 |
oct | 647404106 |
9 | 251811848 |
10 | 111020102 |
11 | 57739056 |
12 | 3121b8b2 |
13 | 1a00178b |
14 | 10a5d314 |
15 | 9b2eca2 |
hex | 69e0846 |
111020102 has 4 divisors (see below), whose sum is σ = 166530156. Its totient is φ = 55510050.
The previous prime is 111020029. The next prime is 111020111. The reversal of 111020102 is 201020111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 201020111 = 11261 ⋅17851.
It is a self number, because there is not a number n which added to its sum of digits gives 111020102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27755024 + ... + 27755027.
It is an arithmetic number, because the mean of its divisors is an integer number (41632539).
Almost surely, 2111020102 is an apocalyptic number.
111020102 is a deficient number, since it is larger than the sum of its proper divisors (55510054).
111020102 is an equidigital number, since it uses as much as digits as its factorization.
111020102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55510053.
The product of its (nonzero) digits is 4, while the sum is 8.
The square root of 111020102 is about 10536.6077083661. The cubic root of 111020102 is about 480.6185630644.
Adding to 111020102 its reverse (201020111), we get a palindrome (312040213).
Subtracting 111020102 from its reverse (201020111), we obtain a palindrome (90000009).
It can be divided in two parts, 1110 and 20102, that added together give a palindrome (21212).
The spelling of 111020102 in words is "one hundred eleven million, twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •