Base | Representation |
---|---|
bin | 10000001001010101010100… |
… | …011100101011110000010001 |
3 | 100022102111111201212210220011 |
4 | 100021111110130223300101 |
5 | 33301412201421011121 |
6 | 411005332242114521 |
7 | 20646211515301246 |
oct | 2011252434536021 |
9 | 308374451783804 |
10 | 71010111110161 |
11 | 20698245545803 |
12 | 7b6a29a64ba41 |
13 | 30812bc9c3462 |
14 | 1376c9cab55cd |
15 | 832208c667e1 |
hex | 40955472bc11 |
71010111110161 has 2 divisors, whose sum is σ = 71010111110162. Its totient is φ = 71010111110160.
The previous prime is 71010111109997. The next prime is 71010111110243. The reversal of 71010111110161 is 16101111101017.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 53680532890000 + 17329578220161 = 7326700^2 + 4162881^2 .
It is a cyclic number.
It is not a de Polignac number, because 71010111110161 - 29 = 71010111109649 is a prime.
It is not a weakly prime, because it can be changed into another prime (71010111110261) 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, 35505055555080 + 35505055555081.
It is an arithmetic number, because the mean of its divisors is an integer number (35505055555081).
Almost surely, 271010111110161 is an apocalyptic number.
It is an amenable number.
71010111110161 is a deficient number, since it is larger than the sum of its proper divisors (1).
71010111110161 is an equidigital number, since it uses as much as digits as its factorization.
71010111110161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 22.
Adding to 71010111110161 its reverse (16101111101017), we get a palindrome (87111222211178).
The spelling of 71010111110161 in words is "seventy-one trillion, ten billion, one hundred eleven million, one hundred ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •