Base | Representation |
---|---|
bin | 11001001111011100001011… |
… | …111100100000100100010001 |
3 | 112120001122221111021011122022 |
4 | 121033130023330200210101 |
5 | 104022311011322023441 |
6 | 1032034150533421225 |
7 | 32245240205510660 |
oct | 3117341374404421 |
9 | 476048844234568 |
10 | 111012220111121 |
11 | 3241002219647a |
12 | 1054aab3a9a815 |
13 | 49c353b1aa984 |
14 | 1d5b03d300dd7 |
15 | cc7a38bc784b |
hex | 64f70bf20911 |
111012220111121 has 8 divisors (see below), whose sum is σ = 126878106312384. Its totient is φ = 95148083313360.
The previous prime is 111012220111087. The next prime is 111012220111127. The reversal of 111012220111121 is 121111022210111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111012220111121 - 242 = 106614173600017 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111012220111121.
It is not an unprimeable number, because it can be changed into a prime (111012220111127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 437214890 + ... + 437468723.
It is an arithmetic number, because the mean of its divisors is an integer number (15859763289048).
Almost surely, 2111012220111121 is an apocalyptic number.
It is an amenable number.
111012220111121 is a deficient number, since it is larger than the sum of its proper divisors (15865886201263).
111012220111121 is an equidigital number, since it uses as much as digits as its factorization.
111012220111121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 874701751.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 111012220111121 its reverse (121111022210111), we get a palindrome (232123242321232).
The spelling of 111012220111121 in words is "one hundred eleven trillion, twelve billion, two hundred twenty million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •