Base | Representation |
---|---|
bin | 110011101100000101… |
… | …1100110011100101010 |
3 | 101121111212011020022110 |
4 | 1213120023212130222 |
5 | 3304312240231442 |
6 | 122554310503150 |
7 | 11006465541351 |
oct | 1473013463452 |
9 | 347455136273 |
10 | 111001102122 |
11 | 43091256a39 |
12 | 1961a064ab6 |
13 | a60ca31921 |
14 | 553013a998 |
15 | 2d49e4569c |
hex | 19d82e672a |
111001102122 has 8 divisors (see below), whose sum is σ = 222002204256. Its totient is φ = 37000367372.
The previous prime is 111001102099. The next prime is 111001102127. The reversal of 111001102122 is 221201100111.
It is a sphenic number, since it is the product of 3 distinct primes.
111001102122 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 111001102098 and 111001102107.
It is not an unprimeable number, because it can be changed into a prime (111001102127) 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 in 3 ways as a sum of consecutive naturals, for example, 9250091838 + ... + 9250091849.
It is an arithmetic number, because the mean of its divisors is an integer number (27750275532).
Almost surely, 2111001102122 is an apocalyptic number.
111001102122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111001102122 is a wasteful number, since it uses less digits than its factorization.
111001102122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18500183692.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 111001102122 its reverse (221201100111), we get a palindrome (332202202233).
The spelling of 111001102122 in words is "one hundred eleven billion, one million, one hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •