Base | Representation |
---|---|
bin | 1001010001101110110010… |
… | …0011100111011001001101 |
3 | 1100010010112221121000001021 |
4 | 2110123230203213121031 |
5 | 2314110023101320302 |
6 | 33405530014314141 |
7 | 2101640662651252 |
oct | 224335443473115 |
9 | 40103487530037 |
10 | 10200221120077 |
11 | 32829869a2a8a |
12 | 1188a554b8951 |
13 | 58cb52217b81 |
14 | 27399c72d429 |
15 | 12a4e79e4437 |
hex | 946ec8e764d |
10200221120077 has 2 divisors, whose sum is σ = 10200221120078. Its totient is φ = 10200221120076.
The previous prime is 10200221119903. The next prime is 10200221120087. The reversal of 10200221120077 is 77002112200201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10165932820836 + 34288299241 = 3188406^2 + 185171^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10200221120077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10200221120087) 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, 5100110560038 + 5100110560039.
It is an arithmetic number, because the mean of its divisors is an integer number (5100110560039).
Almost surely, 210200221120077 is an apocalyptic number.
It is an amenable number.
10200221120077 is a deficient number, since it is larger than the sum of its proper divisors (1).
10200221120077 is an equidigital number, since it uses as much as digits as its factorization.
10200221120077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 784, while the sum is 25.
Adding to 10200221120077 its reverse (77002112200201), we get a palindrome (87202333320278).
The spelling of 10200221120077 in words is "ten trillion, two hundred billion, two hundred twenty-one million, one hundred twenty thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •