Base | Representation |
---|---|
bin | 1001010001101101111110… |
… | …0000001101000111011001 |
3 | 1100010002222200111202102211 |
4 | 2110123133200031013121 |
5 | 2314104101020402301 |
6 | 33405452152355121 |
7 | 2101632363340423 |
oct | 224333740150731 |
9 | 40102880452384 |
10 | 10200002122201 |
11 | 3282884314701 |
12 | 11889b40a5aa1 |
13 | 58cb18a3b628 |
14 | 27397b603813 |
15 | 12a4d3686051 |
hex | 946df80d1d9 |
10200002122201 has 2 divisors, whose sum is σ = 10200002122202. Its totient is φ = 10200002122200.
The previous prime is 10200002122187. The next prime is 10200002122207. The reversal of 10200002122201 is 10222120000201.
It is a happy number.
10200002122201 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 can be written as a sum of positive squares in only one way, i.e., 6966115635600 + 3233886486601 = 2639340^2 + 1798301^2 .
It is a cyclic number.
It is not a de Polignac number, because 10200002122201 - 25 = 10200002122169 is a prime.
It is not a weakly prime, because it can be changed into another prime (10200002122207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100001061100 + 5100001061101.
It is an arithmetic number, because the mean of its divisors is an integer number (5100001061101).
Almost surely, 210200002122201 is an apocalyptic number.
It is an amenable number.
10200002122201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200002122201 is an equidigital number, since it uses as much as digits as its factorization.
10200002122201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 10200002122201 its reverse (10222120000201), we get a palindrome (20422122122402).
The spelling of 10200002122201 in words is "ten trillion, two hundred billion, two million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •