Base | Representation |
---|---|
bin | 11001010000110111010000… |
… | …101011010101011011100010 |
3 | 112120102000100122012021221010 |
4 | 121100313100223111123202 |
5 | 104030411300030013442 |
6 | 1032151122310241350 |
7 | 32255301425042046 |
oct | 3120672053253342 |
9 | 476360318167833 |
10 | 111110010001122 |
11 | 32448544017190 |
12 | 10565a45656256 |
13 | 49cc823b59102 |
14 | 1d61a78a12026 |
15 | cca35dd99b9c |
hex | 650dd0ad56e2 |
111110010001122 has 32 divisors (see below), whose sum is σ = 244822056254784. Its totient is φ = 33336336632000.
The previous prime is 111110010001103. The next prime is 111110010001139. The reversal of 111110010001122 is 221100010011111.
It is a junction number, because it is equal to n+sod(n) for n = 111110010001098 and 111110010001107.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 8334077493 + ... + 8334090824.
It is an arithmetic number, because the mean of its divisors is an integer number (7650689257962).
Almost surely, 2111110010001122 is an apocalyptic number.
111110010001122 is an abundant number, since it is smaller than the sum of its proper divisors (133712046253662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111110010001122 is a wasteful number, since it uses less digits than its factorization.
111110010001122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16668168434.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 111110010001122 its reverse (221100010011111), we get a palindrome (332210020012233).
The spelling of 111110010001122 in words is "one hundred eleven trillion, one hundred ten billion, ten million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •