Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0110001100010111001 |
3 | 101112012202121122210002 |
4 | 1212203010301202321 |
5 | 3301001142320441 |
6 | 122330042002345 |
7 | 10645426402241 |
oct | 1464304614271 |
9 | 345182548702 |
10 | 110110120121 |
11 | 42774323a81 |
12 | 1940b7a63b5 |
13 | a4ca274b41 |
14 | 5487a8ab21 |
15 | 2ce6aeab9b |
hex | 19a31318b9 |
110110120121 has 8 divisors (see below), whose sum is σ = 114907403520. Its totient is φ = 105313660672.
The previous prime is 110110120117. The next prime is 110110120123. The reversal of 110110120121 is 121021011011.
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 110110120121 - 22 = 110110120117 is a prime.
It is a super-2 number, since 2×1101101201212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110110120123) 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 7 ways as a sum of consecutive naturals, for example, 75296 + ... + 475278.
It is an arithmetic number, because the mean of its divisors is an integer number (14363425440).
Almost surely, 2110110120121 is an apocalyptic number.
It is an amenable number.
110110120121 is a deficient number, since it is larger than the sum of its proper divisors (4797283399).
110110120121 is a wasteful number, since it uses less digits than its factorization.
110110120121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411975.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110110120121 its reverse (121021011011), we get a palindrome (231131131132).
The spelling of 110110120121 in words is "one hundred ten billion, one hundred ten million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •