Base | Representation |
---|---|
bin | 100100000110100… |
… | …1101010101000011 |
3 | 10010102111121121012 |
4 | 1020031031111003 |
5 | 4440111001034 |
6 | 320112551135 |
7 | 42006626423 |
oct | 11015152503 |
9 | 3112447535 |
10 | 1211422019 |
11 | 5718a8325 |
12 | 2998524ab |
13 | 163c93382 |
14 | b6c64483 |
15 | 71544cce |
hex | 4834d543 |
1211422019 has 2 divisors, whose sum is σ = 1211422020. Its totient is φ = 1211422018.
The previous prime is 1211421979. The next prime is 1211422021. The reversal of 1211422019 is 9102241121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1211422019 - 212 = 1211417923 is a prime.
It is a super-3 number, since 3×12114220193 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 1211422021, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1211421985 and 1211422003.
It is not a weakly prime, because it can be changed into another prime (1211422099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605711009 + 605711010.
It is an arithmetic number, because the mean of its divisors is an integer number (605711010).
Almost surely, 21211422019 is an apocalyptic number.
1211422019 is a deficient number, since it is larger than the sum of its proper divisors (1).
1211422019 is an equidigital number, since it uses as much as digits as its factorization.
1211422019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 23.
The square root of 1211422019 is about 34805.4883459491. The cubic root of 1211422019 is about 1066.0195131873.
The spelling of 1211422019 in words is "one billion, two hundred eleven million, four hundred twenty-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •