Base | Representation |
---|---|
bin | 111000010110011010… |
… | …0110000000011101001 |
3 | 102120100110202022211110 |
4 | 1300230310300003221 |
5 | 3440312321010441 |
6 | 131331452020533 |
7 | 11512524315216 |
oct | 1605464600351 |
9 | 376313668743 |
10 | 121011110121 |
11 | 47358687120 |
12 | 1b552461749 |
13 | b546814495 |
14 | 5bdd746b0d |
15 | 3233b2db16 |
hex | 1c2cd300e9 |
121011110121 has 8 divisors (see below), whose sum is σ = 176016160224. Its totient is φ = 73340066720.
The previous prime is 121011110063. The next prime is 121011110123.
121011110121 is nontrivially palindromic in base 10.
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 121011110121 - 215 = 121011077353 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121011110097 and 121011110106.
It is not an unprimeable number, because it can be changed into a prime (121011110123) 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, 1833501636 + ... + 1833501701.
It is an arithmetic number, because the mean of its divisors is an integer number (22002020028).
Almost surely, 2121011110121 is an apocalyptic number.
121011110121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121011110121 is a deficient number, since it is larger than the sum of its proper divisors (55005050103).
121011110121 is a wasteful number, since it uses less digits than its factorization.
121011110121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3667003351.
The product of its (nonzero) digits is 4, while the sum is 12.
It can be divided in two parts, 121011 and 110121, that multiplied together give a palindrome (13325852331).
The spelling of 121011110121 in words is "one hundred twenty-one billion, eleven million, one hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •