Base | Representation |
---|---|
bin | 111110000111101… |
… | …011011000110111 |
3 | 2200122002020210102 |
4 | 332013223120313 |
5 | 4113300400434 |
6 | 251225544315 |
7 | 34553361212 |
oct | 7607533067 |
9 | 2618066712 |
10 | 1042200119 |
11 | 495327414 |
12 | 25104509b |
13 | 137bc427c |
14 | 9c5b4779 |
15 | 6176a07e |
hex | 3e1eb637 |
1042200119 has 2 divisors, whose sum is σ = 1042200120. Its totient is φ = 1042200118.
The previous prime is 1042200091. The next prime is 1042200143. The reversal of 1042200119 is 9110022401.
It is a strong prime.
It is an emirp because it is prime and its reverse (9110022401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1042200119 - 28 = 1042199863 is a prime.
It is a super-2 number, since 2×10422001192 = 2172362176087228322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1042200119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1042200149) 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, 521100059 + 521100060.
It is an arithmetic number, because the mean of its divisors is an integer number (521100060).
Almost surely, 21042200119 is an apocalyptic number.
1042200119 is a deficient number, since it is larger than the sum of its proper divisors (1).
1042200119 is an equidigital number, since it uses as much as digits as its factorization.
1042200119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
The square root of 1042200119 is about 32283.1243686233. The cubic root of 1042200119 is about 1013.8733465231.
The spelling of 1042200119 in words is "one billion, forty-two million, two hundred thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •