Base | Representation |
---|---|
bin | 1000100000110… |
… | …10011010001101 |
3 | 11222101001221111 |
4 | 10100122122031 |
5 | 121240130331 |
6 | 11030332021 |
7 | 1524662221 |
oct | 420323215 |
9 | 158331844 |
10 | 71411341 |
11 | 37345441 |
12 | 1baba011 |
13 | 11a44041 |
14 | 96ac781 |
15 | 6408db1 |
hex | 441a68d |
71411341 has 2 divisors, whose sum is σ = 71411342. Its totient is φ = 71411340.
The previous prime is 71411323. The next prime is 71411393. The reversal of 71411341 is 14311417.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69655716 + 1755625 = 8346^2 + 1325^2 .
It is an emirp because it is prime and its reverse (14311417) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 71411341 - 25 = 71411309 is a prime.
It is a super-3 number, since 3×714113413 (a number of 25 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (71411741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35705670 + 35705671.
It is an arithmetic number, because the mean of its divisors is an integer number (35705671).
Almost surely, 271411341 is an apocalyptic number.
It is an amenable number.
71411341 is a deficient number, since it is larger than the sum of its proper divisors (1).
71411341 is an equidigital number, since it uses as much as digits as its factorization.
71411341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 336, while the sum is 22.
The square root of 71411341 is about 8450.5231199021. The cubic root of 71411341 is about 414.8799013776.
Adding to 71411341 its reverse (14311417), we get a palindrome (85722758).
The spelling of 71411341 in words is "seventy-one million, four hundred eleven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •