Base | Representation |
---|---|
bin | 111000011001000100… |
… | …0101001011111110101 |
3 | 102120120200102011220221 |
4 | 1300302020221133311 |
5 | 3441003123242323 |
6 | 131344353454341 |
7 | 11514655551121 |
oct | 1606210513765 |
9 | 376520364827 |
10 | 121100212213 |
11 | 473a3a04912 |
12 | 1b5782713b1 |
13 | b55c110806 |
14 | 5c0b4dc581 |
15 | 323b87e55d |
hex | 1c322297f5 |
121100212213 has 2 divisors, whose sum is σ = 121100212214. Its totient is φ = 121100212212.
The previous prime is 121100212199. The next prime is 121100212273. The reversal of 121100212213 is 312212001121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113853606084 + 7246606129 = 337422^2 + 85127^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121100212213 is a prime.
It is a super-2 number, since 2×1211002122132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121100212273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60550106106 + 60550106107.
It is an arithmetic number, because the mean of its divisors is an integer number (60550106107).
Almost surely, 2121100212213 is an apocalyptic number.
It is an amenable number.
121100212213 is a deficient number, since it is larger than the sum of its proper divisors (1).
121100212213 is an equidigital number, since it uses as much as digits as its factorization.
121100212213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 121100212213 its reverse (312212001121), we get a palindrome (433312213334).
The spelling of 121100212213 in words is "one hundred twenty-one billion, one hundred million, two hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •