Base | Representation |
---|---|
bin | 10001101000111100110… |
… | …100100111001000001101 |
3 | 11021212220101102101211211 |
4 | 101220330310213020031 |
5 | 124330042001432224 |
6 | 2324513314414421 |
7 | 153402322132045 |
oct | 21507464471015 |
9 | 4255811371754 |
10 | 1212201202189 |
11 | 428100a8196a |
12 | 176b23891411 |
13 | 8a405337a83 |
14 | 42956b5c725 |
15 | 217eae51894 |
hex | 11a3cd2720d |
1212201202189 has 2 divisors, whose sum is σ = 1212201202190. Its totient is φ = 1212201202188.
The previous prime is 1212201202159. The next prime is 1212201202237. The reversal of 1212201202189 is 9812021022121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1197619432164 + 14581770025 = 1094358^2 + 120755^2 .
It is a cyclic number.
It is not a de Polignac number, because 1212201202189 - 27 = 1212201202061 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1212201202189.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1212201202129) 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, 606100601094 + 606100601095.
It is an arithmetic number, because the mean of its divisors is an integer number (606100601095).
Almost surely, 21212201202189 is an apocalyptic number.
It is an amenable number.
1212201202189 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212201202189 is an equidigital number, since it uses as much as digits as its factorization.
1212201202189 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 31.
The spelling of 1212201202189 in words is "one trillion, two hundred twelve billion, two hundred one million, two hundred two thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •