Base | Representation |
---|---|
bin | 1110011011010… |
… | …00111100110111 |
3 | 22102201020220111 |
4 | 13031220330313 |
5 | 221440003434 |
6 | 20001443451 |
7 | 2666422450 |
oct | 715507467 |
9 | 272636814 |
10 | 121016119 |
11 | 62346224 |
12 | 34640587 |
13 | 1c0c1593 |
14 | 12102127 |
15 | a956964 |
hex | 7368f37 |
121016119 has 8 divisors (see below), whose sum is σ = 140914080. Its totient is φ = 101770656.
The previous prime is 121016089. The next prime is 121016123. The reversal of 121016119 is 911610121.
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 121016119 - 27 = 121015991 is a prime.
It is a super-2 number, since 2×1210161192 = 29289802115644322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121016119.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121014119) 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, 162724 + ... + 163465.
It is an arithmetic number, because the mean of its divisors is an integer number (17614260).
Almost surely, 2121016119 is an apocalyptic number.
121016119 is a deficient number, since it is larger than the sum of its proper divisors (19897961).
121016119 is an equidigital number, since it uses as much as digits as its factorization.
121016119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326249.
The product of its (nonzero) digits is 108, while the sum is 22.
The square root of 121016119 is about 11000.7326574188. The cubic root of 121016119 is about 494.6307064305.
The spelling of 121016119 in words is "one hundred twenty-one million, sixteen thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •