Base | Representation |
---|---|
bin | 100001000101011… |
… | …0001011010111001 |
3 | 2212100212221112001 |
4 | 1002022301122321 |
5 | 4233142320441 |
6 | 302053421001 |
7 | 36336602545 |
oct | 10212613271 |
9 | 2770787461 |
10 | 1110120121 |
11 | 51a6a7750 |
12 | 26b93a761 |
13 | 148cb5116 |
14 | a7614a25 |
15 | 676d4731 |
hex | 422b16b9 |
1110120121 has 8 divisors (see below), whose sum is σ = 1239204384. Its totient is φ = 985729920.
The previous prime is 1110120097. The next prime is 1110120127. The reversal of 1110120121 is 1210210111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1110120121 - 27 = 1110119993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1110120098 and 1110120107.
It is not an unprimeable number, because it can be changed into a prime (1110120127) 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, 1173016 + ... + 1173961.
It is an arithmetic number, because the mean of its divisors is an integer number (154900548).
Almost surely, 21110120121 is an apocalyptic number.
1110120121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1110120121 is a deficient number, since it is larger than the sum of its proper divisors (129084263).
1110120121 is a wasteful number, since it uses less digits than its factorization.
1110120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2347031.
The product of its (nonzero) digits is 4, while the sum is 10.
The square root of 1110120121 is about 33318.4651657305. The cubic root of 1110120121 is about 1035.4361533925.
Adding to 1110120121 its reverse (1210210111), we get a palindrome (2320330232).
The spelling of 1110120121 in words is "one billion, one hundred ten million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •