Base | Representation |
---|---|
bin | 100001001000001001… |
… | …0000000001001100001 |
3 | 20210121212200021200121 |
4 | 1002100102000021201 |
5 | 2131143332140131 |
6 | 52403055320241 |
7 | 5065630000132 |
oct | 1022022001141 |
9 | 223555607617 |
10 | 71140115041 |
11 | 28196816406 |
12 | 11954820081 |
13 | 6929702338 |
14 | 362c1d7c89 |
15 | 1cb576c911 |
hex | 1090480261 |
71140115041 has 2 divisors, whose sum is σ = 71140115042. Its totient is φ = 71140115040.
The previous prime is 71140115009. The next prime is 71140115069. The reversal of 71140115041 is 14051104117.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69421183441 + 1718931600 = 263479^2 + 41460^2 .
It is an emirp because it is prime and its reverse (14051104117) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 71140115041 - 25 = 71140115009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 71140114997 and 71140115015.
It is not a weakly prime, because it can be changed into another prime (71140115141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35570057520 + 35570057521.
It is an arithmetic number, because the mean of its divisors is an integer number (35570057521).
Almost surely, 271140115041 is an apocalyptic number.
It is an amenable number.
71140115041 is a deficient number, since it is larger than the sum of its proper divisors (1).
71140115041 is an equidigital number, since it uses as much as digits as its factorization.
71140115041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 25.
Adding to 71140115041 its reverse (14051104117), we get a palindrome (85191219158).
The spelling of 71140115041 in words is "seventy-one billion, one hundred forty million, one hundred fifteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •