Base | Representation |
---|---|
bin | 111000011001010111… |
… | …0110100110101011001 |
3 | 102120121101020122012012 |
4 | 1300302232310311121 |
5 | 3441013204020441 |
6 | 131345352155305 |
7 | 11515136612522 |
oct | 1606256646531 |
9 | 376541218165 |
10 | 121110220121 |
11 | 473a961aa10 |
12 | 1b57b698b35 |
13 | b561205b57 |
14 | 5c0c985849 |
15 | 323c6a99eb |
hex | 1c32bb4d59 |
121110220121 has 8 divisors (see below), whose sum is σ = 135192804384. Its totient is φ = 107539729920.
The previous prime is 121110220097. The next prime is 121110220139. The reversal of 121110220121 is 121022011121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121110220121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121110220096 and 121110220105.
It is not an unprimeable number, because it can be changed into a prime (121110220171) 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, 128023016 + ... + 128023961.
It is an arithmetic number, because the mean of its divisors is an integer number (16899100548).
Almost surely, 2121110220121 is an apocalyptic number.
121110220121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121110220121 is a deficient number, since it is larger than the sum of its proper divisors (14082584263).
121110220121 is a wasteful number, since it uses less digits than its factorization.
121110220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 256047031.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 121110220121 its reverse (121022011121), we get a palindrome (242132231242).
The spelling of 121110220121 in words is "one hundred twenty-one billion, one hundred ten million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •