Base | Representation |
---|---|
bin | 10000000001100100101… |
… | …100110111100001010010 |
3 | 10220021101121011112102212 |
4 | 100001210230313201102 |
5 | 121020224441023442 |
6 | 2201515041312122 |
7 | 142362535001150 |
oct | 20014454674122 |
9 | 3807347145385 |
10 | 1101201111122 |
11 | 395020356612 |
12 | 159506035642 |
13 | 7cac589b408 |
14 | 3b426c063d0 |
15 | 1d9a115aa82 |
hex | 10064b37852 |
1101201111122 has 8 divisors (see below), whose sum is σ = 1887773333376. Its totient is φ = 471943333332.
The previous prime is 1101201111121. The next prime is 1101201111137. The reversal of 1101201111122 is 2211111021011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 78657222223 = 1101201111122 / (1 + 1 + 0 + 1 + 2 + 0 + 1 + 1 + 1 + 1 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 1101201111097 and 1101201111106.
It is not an unprimeable number, because it can be changed into a prime (1101201111121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39328611098 + ... + 39328611125.
It is an arithmetic number, because the mean of its divisors is an integer number (235971666672).
Almost surely, 21101201111122 is an apocalyptic number.
1101201111122 is a deficient number, since it is larger than the sum of its proper divisors (786572222254).
1101201111122 is an equidigital number, since it uses as much as digits as its factorization.
1101201111122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78657222232.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 1101201111122 its reverse (2211111021011), we get a palindrome (3312312132133).
The spelling of 1101201111122 in words is "one trillion, one hundred one billion, two hundred one million, one hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •