Base | Representation |
---|---|
bin | 11101011011001000101… |
… | …11001011001001010001 |
3 | 10120122120101221202220002 |
4 | 32231210113023021101 |
5 | 113031012241023441 |
6 | 2052240354255345 |
7 | 133020356440211 |
oct | 16554427131121 |
9 | 3518511852802 |
10 | 1011001111121 |
11 | 35a843852571 |
12 | 143b32287555 |
13 | 7444c4c1b51 |
14 | 36d0b526241 |
15 | 1b472474b9b |
hex | eb645cb251 |
1011001111121 has 8 divisors (see below), whose sum is σ = 1034529434400. Its totient is φ = 987473545632.
The previous prime is 1011001111069. The next prime is 1011001111129. The reversal of 1011001111121 is 1211111001101.
It is a happy number.
1011001111121 is digitally balanced in base 2, 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 cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1011001111121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1011001111129) 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, 3212405 + ... + 3513053.
It is an arithmetic number, because the mean of its divisors is an integer number (129316179300).
Almost surely, 21011001111121 is an apocalyptic number.
It is an amenable number.
1011001111121 is a deficient number, since it is larger than the sum of its proper divisors (23528323279).
1011001111121 is an equidigital number, since it uses as much as digits as its factorization.
1011001111121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 378895.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 1011001111121 its reverse (1211111001101), we get a palindrome (2222112112222).
The spelling of 1011001111121 in words is "one trillion, eleven billion, one million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •