Base | Representation |
---|---|
bin | 10110111111001110100101… |
… | …111111010010000011000001 |
3 | 111020222020222121101110001012 |
4 | 112333032211333102003001 |
5 | 101222423414110311202 |
6 | 555005343220050305 |
7 | 30203244206522264 |
oct | 2677164577220301 |
9 | 436866877343035 |
10 | 101102020010177 |
11 | 2a23a14263176a |
12 | b40a2b9b33995 |
13 | 4454b585834c4 |
14 | 1ad75146a2cdb |
15 | ba4d67787152 |
hex | 5bf3a5fd20c1 |
101102020010177 has 2 divisors, whose sum is σ = 101102020010178. Its totient is φ = 101102020010176.
The previous prime is 101102020010171. The next prime is 101102020010261. The reversal of 101102020010177 is 771010020201101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101096268152896 + 5751857281 = 10054664^2 + 75841^2 .
It is an emirp because it is prime and its reverse (771010020201101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101102020010177 - 216 = 101102019944641 is a prime.
It is not a weakly prime, because it can be changed into another prime (101102020010171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50551010005088 + 50551010005089.
It is an arithmetic number, because the mean of its divisors is an integer number (50551010005089).
Almost surely, 2101102020010177 is an apocalyptic number.
It is an amenable number.
101102020010177 is a deficient number, since it is larger than the sum of its proper divisors (1).
101102020010177 is an equidigital number, since it uses as much as digits as its factorization.
101102020010177 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 196, while the sum is 23.
Adding to 101102020010177 its reverse (771010020201101), we get a palindrome (872112040211278).
The spelling of 101102020010177 in words is "one hundred one trillion, one hundred two billion, twenty million, ten thousand, one hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •