Base | Representation |
---|---|
bin | 100001000100111001… |
… | …0111010011111010101 |
3 | 20210100021221000101201 |
4 | 1002021302322133111 |
5 | 2130433003131401 |
6 | 52344211152501 |
7 | 5063136051214 |
oct | 1021162723725 |
9 | 223307830351 |
10 | 71031302101 |
11 | 28140355661 |
12 | 119242a5731 |
13 | 690ccc4396 |
14 | 361b99107b |
15 | 1caae26b01 |
hex | 1089cba7d5 |
71031302101 has 2 divisors, whose sum is σ = 71031302102. Its totient is φ = 71031302100.
The previous prime is 71031302099. The next prime is 71031302129. The reversal of 71031302101 is 10120313017.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69261080625 + 1770221476 = 263175^2 + 42074^2 .
It is an emirp because it is prime and its reverse (10120313017) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 71031302101 - 21 = 71031302099 is a prime.
Together with 71031302099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (71031302141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35515651050 + 35515651051.
It is an arithmetic number, because the mean of its divisors is an integer number (35515651051).
Almost surely, 271031302101 is an apocalyptic number.
It is an amenable number.
71031302101 is a deficient number, since it is larger than the sum of its proper divisors (1).
71031302101 is an equidigital number, since it uses as much as digits as its factorization.
71031302101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 19.
Adding to 71031302101 its reverse (10120313017), we get a palindrome (81151615118).
The spelling of 71031302101 in words is "seventy-one billion, thirty-one million, three hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •