Base | Representation |
---|---|
bin | 111000011100010101… |
… | …1100000000111011001 |
3 | 102120212100000121002012 |
4 | 1300320223200013121 |
5 | 3441214230341441 |
6 | 131403315115305 |
7 | 11520461050352 |
oct | 1607053400731 |
9 | 376770017065 |
10 | 121210012121 |
11 | 4744a98a140 |
12 | 1b5a8ba2b35 |
13 | b578aa5a83 |
14 | 5c1bd20d29 |
15 | 324631c9eb |
hex | 1c38ae01d9 |
121210012121 has 32 divisors (see below), whose sum is σ = 150807453696. Its totient is φ = 95999904000.
The previous prime is 121210012117. The next prime is 121210012123.
121210012121 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 121210012121 - 22 = 121210012117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121210012096 and 121210012105.
It is not an unprimeable number, because it can be changed into a prime (121210012123) 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 31 ways as a sum of consecutive naturals, for example, 321215 + ... + 587876.
It is an arithmetic number, because the mean of its divisors is an integer number (4712732928).
Almost surely, 2121210012121 is an apocalyptic number.
121210012121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121210012121 is a deficient number, since it is larger than the sum of its proper divisors (29597441575).
121210012121 is a wasteful number, since it uses less digits than its factorization.
121210012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 909173.
The product of its (nonzero) digits is 16, while the sum is 14.
It can be divided in two parts, 1212100 and 12121, that multiplied together give a square (14691864100 = 1212102).
The spelling of 121210012121 in words is "one hundred twenty-one billion, two hundred ten million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •