Base | Representation |
---|---|
bin | 111000110011101001… |
… | …1000001111100000001 |
3 | 102122212211201002220122 |
4 | 1301213103001330001 |
5 | 3444314441014314 |
6 | 132013054350025 |
7 | 11546035651352 |
oct | 1614723017401 |
9 | 378784632818 |
10 | 121992126209 |
11 | 47811414018 |
12 | 1b786abb315 |
13 | b671b35885 |
14 | 5c93b51d29 |
15 | 328ed1028e |
hex | 1c674c1f01 |
121992126209 has 2 divisors, whose sum is σ = 121992126210. Its totient is φ = 121992126208.
The previous prime is 121992126169. The next prime is 121992126211. The reversal of 121992126209 is 902621299121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113164960000 + 8827166209 = 336400^2 + 93953^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121992126209 is a prime.
Together with 121992126211, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121992126209.
It is not a weakly prime, because it can be changed into another prime (121992120209) 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 as a sum of consecutive naturals, namely, 60996063104 + 60996063105.
It is an arithmetic number, because the mean of its divisors is an integer number (60996063105).
Almost surely, 2121992126209 is an apocalyptic number.
It is an amenable number.
121992126209 is a deficient number, since it is larger than the sum of its proper divisors (1).
121992126209 is an equidigital number, since it uses as much as digits as its factorization.
121992126209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69984, while the sum is 44.
The spelling of 121992126209 in words is "one hundred twenty-one billion, nine hundred ninety-two million, one hundred twenty-six thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.426 sec. • engine limits •