Base | Representation |
---|---|
bin | 100001010001101100… |
… | …1100000011111111101 |
3 | 20211110020012021212121 |
4 | 1002203121200133331 |
5 | 2132322434142121 |
6 | 52454554002541 |
7 | 5106603125365 |
oct | 1024331403775 |
9 | 224406167777 |
10 | 71460849661 |
11 | 28340872043 |
12 | 11a24116451 |
13 | 697acaca36 |
14 | 365ca479a5 |
15 | 1cd39c5141 |
hex | 10a36607fd |
71460849661 has 2 divisors, whose sum is σ = 71460849662. Its totient is φ = 71460849660.
The previous prime is 71460849571. The next prime is 71460849703. The reversal of 71460849661 is 16694806417.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 59252809561 + 12208040100 = 243419^2 + 110490^2 .
It is an emirp because it is prime and its reverse (16694806417) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 71460849661 - 219 = 71460325373 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 71460849599 and 71460849608.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (71461849661) 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, 35730424830 + 35730424831.
It is an arithmetic number, because the mean of its divisors is an integer number (35730424831).
Almost surely, 271460849661 is an apocalyptic number.
It is an amenable number.
71460849661 is a deficient number, since it is larger than the sum of its proper divisors (1).
71460849661 is an equidigital number, since it uses as much as digits as its factorization.
71460849661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1741824, while the sum is 52.
The spelling of 71460849661 in words is "seventy-one billion, four hundred sixty million, eight hundred forty-nine thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •