Base | Representation |
---|---|
bin | 1101110101111… |
… | …01101000111001 |
3 | 22002111111212020 |
4 | 12322331220321 |
5 | 214211320441 |
6 | 15304505053 |
7 | 2610001425 |
oct | 672755071 |
9 | 262444766 |
10 | 116120121 |
11 | 5a601847 |
12 | 32a7b189 |
13 | 1b098c40 |
14 | 115c9b85 |
15 | a2dae66 |
hex | 6ebda39 |
116120121 has 16 divisors (see below), whose sum is σ = 167084736. Its totient is φ = 71309376.
The previous prime is 116120113. The next prime is 116120129. The reversal of 116120121 is 121021611.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (116120113) and next prime (116120129).
It is not a de Polignac number, because 116120121 - 23 = 116120113 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 116120121.
It is not an unprimeable number, because it can be changed into a prime (116120129) 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 15 ways as a sum of consecutive naturals, for example, 17551 + ... + 23243.
It is an arithmetic number, because the mean of its divisors is an integer number (10442796).
Almost surely, 2116120121 is an apocalyptic number.
It is an amenable number.
116120121 is a deficient number, since it is larger than the sum of its proper divisors (50964615).
116120121 is a wasteful number, since it uses less digits than its factorization.
116120121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6232.
The product of its (nonzero) digits is 24, while the sum is 15.
The square root of 116120121 is about 10775.9046487986. The cubic root of 116120121 is about 487.8681799850.
Adding to 116120121 its reverse (121021611), we get a palindrome (237141732).
The spelling of 116120121 in words is "one hundred sixteen million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •