Base | Representation |
---|---|
bin | 1000011110011… |
… | …10001010110001 |
3 | 11221210012120102 |
4 | 10033032022301 |
5 | 121200132212 |
6 | 11015522145 |
7 | 1522221611 |
oct | 417161261 |
9 | 157705512 |
10 | 71099057 |
11 | 37151857 |
12 | 1b989355 |
13 | 11964b63 |
14 | 962aa41 |
15 | 63965c2 |
hex | 43ce2b1 |
71099057 has 2 divisors, whose sum is σ = 71099058. Its totient is φ = 71099056.
The previous prime is 71099047. The next prime is 71099107. The reversal of 71099057 is 75099017.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 65674816 + 5424241 = 8104^2 + 2329^2 .
It is a cyclic number.
It is not a de Polignac number, because 71099057 - 210 = 71098033 is a prime.
It is a super-3 number, since 3×710990573 (a number of 25 digits) contains 333 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 71099057.
It is not a weakly prime, because it can be changed into another prime (71099047) 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, 35549528 + 35549529.
It is an arithmetic number, because the mean of its divisors is an integer number (35549529).
Almost surely, 271099057 is an apocalyptic number.
It is an amenable number.
71099057 is a deficient number, since it is larger than the sum of its proper divisors (1).
71099057 is an equidigital number, since it uses as much as digits as its factorization.
71099057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19845, while the sum is 38.
The square root of 71099057 is about 8432.0256759571. The cubic root of 71099057 is about 414.2742568090.
The spelling of 71099057 in words is "seventy-one million, ninety-nine thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •