Base | Representation |
---|---|
bin | 110011110010100111… |
… | …1000110001000001010 |
3 | 101122002010021121021022 |
4 | 1213211033012020022 |
5 | 3310234322401442 |
6 | 123032133112442 |
7 | 11015065303544 |
oct | 1474517061012 |
9 | 348063247238 |
10 | 111220122122 |
11 | 4319394a9aa |
12 | 1967b488722 |
13 | a646218265 |
14 | 5551270694 |
15 | 2d5e2aa3d2 |
hex | 19e53c620a |
111220122122 has 8 divisors (see below), whose sum is σ = 175610719200. Its totient is φ = 52683215724.
The previous prime is 111220122071. The next prime is 111220122127. The reversal of 111220122122 is 221221022111.
111220122122 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 111220122122.
It is not an unprimeable number, because it can be changed into a prime (111220122127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1463422622 + ... + 1463422697.
It is an arithmetic number, because the mean of its divisors is an integer number (21951339900).
Almost surely, 2111220122122 is an apocalyptic number.
111220122122 is a deficient number, since it is larger than the sum of its proper divisors (64390597078).
111220122122 is a wasteful number, since it uses less digits than its factorization.
111220122122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2926845340.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 111220122122 its reverse (221221022111), we get a palindrome (332441144233).
The spelling of 111220122122 in words is "one hundred eleven billion, two hundred twenty million, one hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •