Base | Representation |
---|---|
bin | 101101100001011100001100… |
… | …100111101001001101000011 |
3 | 222020212220021221211211212021 |
4 | 231201130030213221031003 |
5 | 202220220302212101034 |
6 | 1545451131131342311 |
7 | 60112463135611414 |
oct | 5541341447511503 |
9 | 866786257754767 |
10 | 200210112222019 |
11 | 5887a6a4978629 |
12 | 1a5560895b1997 |
13 | 879396a5cb083 |
14 | 3762314b1b80b |
15 | 1822dd018c6b4 |
hex | b6170c9e9343 |
200210112222019 has 2 divisors, whose sum is σ = 200210112222020. Its totient is φ = 200210112222018.
The previous prime is 200210112221983. The next prime is 200210112222023. The reversal of 200210112222019 is 910222211012002.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200210112222019 - 29 = 200210112221507 is a prime.
It is a super-2 number, since 2×2002101122220192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200210112221984 and 200210112222002.
It is not a weakly prime, because it can be changed into another prime (200210112222119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105056111009 + 100105056111010.
It is an arithmetic number, because the mean of its divisors is an integer number (100105056111010).
Almost surely, 2200210112222019 is an apocalyptic number.
200210112222019 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210112222019 is an equidigital number, since it uses as much as digits as its factorization.
200210112222019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 200210112222019 in words is "two hundred trillion, two hundred ten billion, one hundred twelve million, two hundred twenty-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •