Base | Representation |
---|---|
bin | 1011101001000110001… |
… | …0000100001100100101 |
3 | 201010021001022221022002 |
4 | 2322101202010030211 |
5 | 11234110042401041 |
6 | 231514451015045 |
7 | 20310302662163 |
oct | 2722142041445 |
9 | 633231287262 |
10 | 200010122021 |
11 | 77907555006 |
12 | 3291ab9a485 |
13 | 15b26454438 |
14 | 9975598233 |
15 | 53092c359b |
hex | 2e91884325 |
200010122021 has 2 divisors, whose sum is σ = 200010122022. Its totient is φ = 200010122020.
The previous prime is 200010122009. The next prime is 200010122023. The reversal of 200010122021 is 120221010002.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 163207920100 + 36802201921 = 403990^2 + 191839^2 .
It is a cyclic number.
It is not a de Polignac number, because 200010122021 - 214 = 200010105637 is a prime.
Together with 200010122023, 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 = 200010121993 and 200010122011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200010122023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100005061010 + 100005061011.
It is an arithmetic number, because the mean of its divisors is an integer number (100005061011).
Almost surely, 2200010122021 is an apocalyptic number.
It is an amenable number.
200010122021 is a deficient number, since it is larger than the sum of its proper divisors (1).
200010122021 is an equidigital number, since it uses as much as digits as its factorization.
200010122021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 200010122021 its reverse (120221010002), we get a palindrome (320231132023).
The spelling of 200010122021 in words is "two hundred billion, ten million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •