Base | Representation |
---|---|
bin | 10110111110000010011001… |
… | …101111101000010111100001 |
3 | 111020200102211010210121001202 |
4 | 112332002121233220113201 |
5 | 101220103342302431311 |
6 | 554504013252010545 |
7 | 30164316660603242 |
oct | 2676023157502741 |
9 | 436612733717052 |
10 | 101020210202081 |
11 | 2a208481082015 |
12 | b3b6488000a55 |
13 | 444a21b506231 |
14 | 1ad359341acc9 |
15 | ba2b7a473e3b |
hex | 5be099be85e1 |
101020210202081 has 2 divisors, whose sum is σ = 101020210202082. Its totient is φ = 101020210202080.
The previous prime is 101020210202063. The next prime is 101020210202113. The reversal of 101020210202081 is 180202012020101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 73980366201856 + 27039844000225 = 8601184^2 + 5199985^2 .
It is a cyclic number.
It is not a de Polignac number, because 101020210202081 - 218 = 101020209939937 is a prime.
It is a super-2 number, since 2×1010202102020812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101020210201081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50510105101040 + 50510105101041.
It is an arithmetic number, because the mean of its divisors is an integer number (50510105101041).
Almost surely, 2101020210202081 is an apocalyptic number.
It is an amenable number.
101020210202081 is a deficient number, since it is larger than the sum of its proper divisors (1).
101020210202081 is an equidigital number, since it uses as much as digits as its factorization.
101020210202081 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 20.
Adding to 101020210202081 its reverse (180202012020101), we get a palindrome (281222222222182).
The spelling of 101020210202081 in words is "one hundred one trillion, twenty billion, two hundred ten million, two hundred two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •