Base | Representation |
---|---|
bin | 101111110001011000101111… |
… | …000100111111001001000001 |
3 | 1000112220112222121220022011101 |
4 | 233301120233010333021001 |
5 | 210014302344001201311 |
6 | 2022503305405014401 |
7 | 62153240264603566 |
oct | 5761305704771101 |
9 | 1015815877808141 |
10 | 210102000022081 |
11 | 60a43837734682 |
12 | 1b693212854401 |
13 | 90306c23ab24b |
14 | 39c4dc367686d |
15 | 194537dad5ec1 |
hex | bf162f13f241 |
210102000022081 has 2 divisors, whose sum is σ = 210102000022082. Its totient is φ = 210102000022080.
The previous prime is 210102000022043. The next prime is 210102000022157. The reversal of 210102000022081 is 180220000201012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 133002800243856 + 77099199778225 = 11532684^2 + 8780615^2 .
It is a cyclic number.
It is not a de Polignac number, because 210102000022081 - 29 = 210102000021569 is a prime.
It is a super-2 number, since 2×2101020000220812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (210102000622081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105051000011040 + 105051000011041.
It is an arithmetic number, because the mean of its divisors is an integer number (105051000011041).
Almost surely, 2210102000022081 is an apocalyptic number.
It is an amenable number.
210102000022081 is a deficient number, since it is larger than the sum of its proper divisors (1).
210102000022081 is an equidigital number, since it uses as much as digits as its factorization.
210102000022081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 210102000022081 its reverse (180220000201012), we get a palindrome (390322000223093).
The spelling of 210102000022081 in words is "two hundred ten trillion, one hundred two billion, twenty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •