Base | Representation |
---|---|
bin | 1100001110101100001… |
… | …1100110011111101101 |
3 | 202002022101000110212011 |
4 | 3003223003212133231 |
5 | 11420242104120302 |
6 | 240304115241221 |
7 | 21115344463405 |
oct | 3035303463755 |
9 | 662271013764 |
10 | 210102020077 |
11 | 81116127424 |
12 | 348768a9211 |
13 | 16a741a9751 |
14 | a2519dd805 |
15 | 56ea2855d7 |
hex | 30eb0e67ed |
210102020077 has 2 divisors, whose sum is σ = 210102020078. Its totient is φ = 210102020076.
The previous prime is 210102020053. The next prime is 210102020099. The reversal of 210102020077 is 770020201012.
It is an a-pointer prime, because the next prime (210102020099) can be obtained adding 210102020077 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 170824329481 + 39277690596 = 413309^2 + 198186^2 .
It is a cyclic number.
It is not a de Polignac number, because 210102020077 - 215 = 210101987309 is a prime.
It is a super-2 number, since 2×2101020200772 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210102029077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105051010038 + 105051010039.
It is an arithmetic number, because the mean of its divisors is an integer number (105051010039).
Almost surely, 2210102020077 is an apocalyptic number.
It is an amenable number.
210102020077 is a deficient number, since it is larger than the sum of its proper divisors (1).
210102020077 is an equidigital number, since it uses as much as digits as its factorization.
210102020077 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 392, while the sum is 22.
Adding to 210102020077 its reverse (770020201012), we get a palindrome (980122221089).
The spelling of 210102020077 in words is "two hundred ten billion, one hundred two million, twenty thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •