Base | Representation |
---|---|
bin | 11001000010010110110100… |
… | …111000101000011011111010 |
3 | 112102212201012001102210100110 |
4 | 121002112310320220123322 |
5 | 103413043122443441442 |
6 | 1030105133123445150 |
7 | 32123260356021042 |
oct | 3102266470503372 |
9 | 472781161383313 |
10 | 110113111312122 |
11 | 320a3787769136 |
12 | 104247aa2267b6 |
13 | 4959811257249 |
14 | 1d29708424722 |
15 | cae464a3a69c |
hex | 6425b4e286fa |
110113111312122 has 8 divisors (see below), whose sum is σ = 220226222624256. Its totient is φ = 36704370437372.
The previous prime is 110113111312073. The next prime is 110113111312157. The reversal of 110113111312122 is 221213111311011.
It is a sphenic number, since it is the product of 3 distinct primes.
110113111312122 is an admirable number.
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 3 ways as a sum of consecutive naturals, for example, 9176092609338 + ... + 9176092609349.
It is an arithmetic number, because the mean of its divisors is an integer number (27528277828032).
Almost surely, 2110113111312122 is an apocalyptic number.
110113111312122 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.
110113111312122 is a wasteful number, since it uses less digits than its factorization.
110113111312122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18352185218692.
The product of its (nonzero) digits is 72, while the sum is 21.
Adding to 110113111312122 its reverse (221213111311011), we get a palindrome (331326222623133).
The spelling of 110113111312122 in words is "one hundred ten trillion, one hundred thirteen billion, one hundred eleven million, three hundred twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •