Base | Representation |
---|---|
bin | 1000011101110… |
… | …01100100011001 |
3 | 11221121220211101 |
4 | 10032321210121 |
5 | 121134432211 |
6 | 11014031401 |
7 | 1521420613 |
oct | 416714431 |
9 | 157556741 |
10 | 71014681 |
11 | 370a4421 |
12 | 1b948561 |
13 | 1193562a |
14 | 9607db3 |
15 | 637b5c1 |
hex | 43b9919 |
71014681 has 2 divisors, whose sum is σ = 71014682. Its totient is φ = 71014680.
The previous prime is 71014667. The next prime is 71014687. The reversal of 71014681 is 18641017.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 56115081 + 14899600 = 7491^2 + 3860^2 .
It is a cyclic number.
It is not a de Polignac number, because 71014681 - 213 = 71006489 is a prime.
It is a super-2 number, since 2×710146812 = 10086169835063522, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (71014687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35507340 + 35507341.
It is an arithmetic number, because the mean of its divisors is an integer number (35507341).
Almost surely, 271014681 is an apocalyptic number.
It is an amenable number.
71014681 is a deficient number, since it is larger than the sum of its proper divisors (1).
71014681 is an equidigital number, since it uses as much as digits as its factorization.
71014681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 28.
The square root of 71014681 is about 8427.0208852239. The cubic root of 71014681 is about 414.1103135131.
Adding to 71014681 its reverse (18641017), we get a palindrome (89655698).
It can be divided in two parts, 7101 and 4681, that multiplied together give a triangular number (33239781 = T8153).
The spelling of 71014681 in words is "seventy-one million, fourteen thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •