Base | Representation |
---|---|
bin | 110011110101000101… |
… | …1101011010110111010 |
3 | 101122021220102221011000 |
4 | 1213222023223112322 |
5 | 3310422044041442 |
6 | 123044255545430 |
7 | 11020123562106 |
oct | 1475213532672 |
9 | 348256387130 |
10 | 111303112122 |
11 | 43226783584 |
12 | 196a322b276 |
13 | a65a484577 |
14 | 555c2b4906 |
15 | 2d666eed4c |
hex | 19ea2eb5ba |
111303112122 has 32 divisors (see below), whose sum is σ = 248375174400. Its totient is φ = 36945798624.
The previous prime is 111303112097. The next prime is 111303112169. The reversal of 111303112122 is 221211303111.
111303112122 is a `hidden beast` number, since 11 + 130 + 311 + 212 + 2 = 666.
111303112122 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 111303112095 and 111303112104.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4299163 + ... + 4324974.
It is an arithmetic number, because the mean of its divisors is an integer number (7761724200).
Almost surely, 2111303112122 is an apocalyptic number.
111303112122 is an abundant number, since it is smaller than the sum of its proper divisors (137072062278).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111303112122 is a wasteful number, since it uses less digits than its factorization.
111303112122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8624387 (or 8624381 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 111303112122 its reverse (221211303111), we get a palindrome (332514415233).
The spelling of 111303112122 in words is "one hundred eleven billion, three hundred three million, one hundred twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •