Base | Representation |
---|---|
bin | 1011101010101000010… |
… | …1110001000101100111 |
3 | 201011022202121022122102 |
4 | 2322222011301011213 |
5 | 11240431031242434 |
6 | 232023405522315 |
7 | 20323435013504 |
oct | 2725205610547 |
9 | 634282538572 |
10 | 200422134119 |
11 | 77aa9084879 |
12 | 32a14b7339b |
13 | 15b9091038c |
14 | 99b41a84ab |
15 | 533055b07e |
hex | 2eaa171167 |
200422134119 has 2 divisors, whose sum is σ = 200422134120. Its totient is φ = 200422134118.
The previous prime is 200422133903. The next prime is 200422134127. The reversal of 200422134119 is 911431224002.
200422134119 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200422134119 - 224 = 200405356903 is a prime.
It is a super-2 number, since 2×2004221341192 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200422134091 and 200422134100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200422134719) 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, 100211067059 + 100211067060.
It is an arithmetic number, because the mean of its divisors is an integer number (100211067060).
Almost surely, 2200422134119 is an apocalyptic number.
200422134119 is a deficient number, since it is larger than the sum of its proper divisors (1).
200422134119 is an equidigital number, since it uses as much as digits as its factorization.
200422134119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
The spelling of 200422134119 in words is "two hundred billion, four hundred twenty-two million, one hundred thirty-four thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •