Base | Representation |
---|---|
bin | 111000011001011010… |
… | …1100111111000111111 |
3 | 102120121111121011121211 |
4 | 1300302311213320333 |
5 | 3441014133031421 |
6 | 131345454305251 |
7 | 11515161014032 |
oct | 1606265477077 |
9 | 376544534554 |
10 | 121112002111 |
11 | 473aa627831 |
12 | 1b5801b8227 |
13 | b5616aac99 |
14 | 5c0cccb019 |
15 | 323c90c9e1 |
hex | 1c32d67e3f |
121112002111 has 8 divisors (see below), whose sum is σ = 124708790304. Its totient is φ = 117545825280.
The previous prime is 121112002093. The next prime is 121112002117. The reversal of 121112002111 is 111200211121.
It is a happy number.
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 121112002111 - 29 = 121112001599 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121112002091 and 121112002100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121112002117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7644811 + ... + 7660636.
It is an arithmetic number, because the mean of its divisors is an integer number (15588598788).
Almost surely, 2121112002111 is an apocalyptic number.
121112002111 is a deficient number, since it is larger than the sum of its proper divisors (3596788193).
121112002111 is a wasteful number, since it uses less digits than its factorization.
121112002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15305681.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 121112002111 its reverse (111200211121), we get a palindrome (232312213232).
The spelling of 121112002111 in words is "one hundred twenty-one billion, one hundred twelve million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •