Base | Representation |
---|---|
bin | 111000011100010111… |
… | …1010110001101011001 |
3 | 102120212101220210210112 |
4 | 1300320233112031121 |
5 | 3441220010120441 |
6 | 131403352454105 |
7 | 11520502446212 |
oct | 1607057261531 |
9 | 376771823715 |
10 | 121211020121 |
11 | 474505084a4 |
12 | 1b5a93aa335 |
13 | b579069819 |
14 | 5c1c104409 |
15 | 324646b4eb |
hex | 1c38bd6359 |
121211020121 has 8 divisors (see below), whose sum is σ = 125984985600. Its totient is φ = 116476673040.
The previous prime is 121211020093. The next prime is 121211020141. The reversal of 121211020121 is 121020112121.
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 121211020121 - 226 = 121143911257 is a prime.
It is a super-2 number, since 2×1212110201212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121211020096 and 121211020105.
It is not an unprimeable number, because it can be changed into a prime (121211020141) 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, 9898361 + ... + 9910598.
It is an arithmetic number, because the mean of its divisors is an integer number (15748123200).
Almost surely, 2121211020121 is an apocalyptic number.
It is an amenable number.
121211020121 is a deficient number, since it is larger than the sum of its proper divisors (4773965479).
121211020121 is a wasteful number, since it uses less digits than its factorization.
121211020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19809199.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 121211020121 its reverse (121020112121), we get a palindrome (242231132242).
The spelling of 121211020121 in words is "one hundred twenty-one billion, two hundred eleven million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •