Base | Representation |
---|---|
bin | 101111110000000011001111… |
… | …011100010011110011100001 |
3 | 1000112120210001000020110212101 |
4 | 233300003033130103303201 |
5 | 210011301343002210311 |
6 | 2022353204325530401 |
7 | 62143510363561306 |
oct | 5760031734236341 |
9 | 1015523030213771 |
10 | 210010201210081 |
11 | 60a0890a6a04a8 |
12 | 1b679473573a01 |
13 | 9024b529c388c |
14 | 39c07958d10ad |
15 | 1942ca9887ec1 |
hex | bf00cf713ce1 |
210010201210081 has 2 divisors, whose sum is σ = 210010201210082. Its totient is φ = 210010201210080.
The previous prime is 210010201210009. The next prime is 210010201210099. The reversal of 210010201210081 is 180012102010012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 157659188050081 + 52351013160000 = 12556241^2 + 7235400^2 .
It is a cyclic number.
It is not a de Polignac number, because 210010201210081 - 227 = 210010066992353 is a prime.
It is a super-2 number, since 2×2100102012100812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (210010201210681) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105005100605040 + 105005100605041.
It is an arithmetic number, because the mean of its divisors is an integer number (105005100605041).
Almost surely, 2210010201210081 is an apocalyptic number.
It is an amenable number.
210010201210081 is a deficient number, since it is larger than the sum of its proper divisors (1).
210010201210081 is an equidigital number, since it uses as much as digits as its factorization.
210010201210081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 210010201210081 its reverse (180012102010012), we get a palindrome (390022303220093).
The spelling of 210010201210081 in words is "two hundred ten trillion, ten billion, two hundred one million, two hundred ten thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •