Base | Representation |
---|---|
bin | 111000011100010111… |
… | …1010011110010100011 |
3 | 102120212101220022012111 |
4 | 1300320233103302203 |
5 | 3441220004311321 |
6 | 131403352340151 |
7 | 11520502405264 |
oct | 1607057236243 |
9 | 376771808174 |
10 | 121211010211 |
11 | 47450501005 |
12 | 1b5a93a4657 |
13 | b579065165 |
14 | 5c1c10096b |
15 | 32464685e1 |
hex | 1c38bd3ca3 |
121211010211 has 8 divisors (see below), whose sum is σ = 122678619840. Its totient is φ = 119743573032.
The previous prime is 121211010187. The next prime is 121211010227. The reversal of 121211010211 is 112010112121.
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 121211010211 - 27 = 121211010083 is a prime.
It is a super-2 number, since 2×1212110102112 (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 = 121211010191 and 121211010200.
It is not an unprimeable number, because it can be changed into a prime (121211010241) 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, 1894380 + ... + 1957318.
It is an arithmetic number, because the mean of its divisors is an integer number (15334827480).
Almost surely, 2121211010211 is an apocalyptic number.
121211010211 is a deficient number, since it is larger than the sum of its proper divisors (1467609629).
121211010211 is an equidigital number, since it uses as much as digits as its factorization.
121211010211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86225.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 121211010211 its reverse (112010112121), we get a palindrome (233221122332).
The spelling of 121211010211 in words is "one hundred twenty-one billion, two hundred eleven million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •