Base | Representation |
---|---|
bin | 11001010000111000010010… |
… | …001111100100110000000110 |
3 | 112120102010012022002001021211 |
4 | 121100320102033210300012 |
5 | 104030421023131120402 |
6 | 1032151423403402034 |
7 | 32255340613044343 |
oct | 3120702217446006 |
9 | 476363168061254 |
10 | 111111110020102 |
11 | 32448a58a44785 |
12 | 105660b1b2331a |
13 | 49cc96aa1560a |
14 | 1d61b40b577ca |
15 | cca3c57364d7 |
hex | 650e123e4c06 |
111111110020102 has 4 divisors (see below), whose sum is σ = 166666665030156. Its totient is φ = 55555555010050.
The previous prime is 111111110020087. The next prime is 111111110020109. The reversal of 111111110020102 is 201020011111111.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1111111100201022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111111110020109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27777777505024 + ... + 27777777505027.
It is an arithmetic number, because the mean of its divisors is an integer number (41666666257539).
Almost surely, 2111111110020102 is an apocalyptic number.
111111110020102 is a deficient number, since it is larger than the sum of its proper divisors (55555555010054).
111111110020102 is an equidigital number, since it uses as much as digits as its factorization.
111111110020102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55555555010053.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 111111110020102 its reverse (201020011111111), we get a palindrome (312131121131213).
The spelling of 111111110020102 in words is "one hundred eleven trillion, one hundred eleven billion, one hundred ten million, twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •