Base | Representation |
---|---|
bin | 1000011110001… |
… | …11010110010001 |
3 | 11221201210020202 |
4 | 10033013112101 |
5 | 121143233441 |
6 | 11015144545 |
7 | 1522044302 |
oct | 417072621 |
9 | 157653222 |
10 | 71071121 |
11 | 37132870 |
12 | 1b975155 |
13 | 11955224 |
14 | 96207a9 |
15 | 638d19b |
hex | 43c7591 |
71071121 has 16 divisors (see below), whose sum is σ = 79827648. Its totient is φ = 62726400.
The previous prime is 71071111. The next prime is 71071123. The reversal of 71071121 is 12117017.
It is not a de Polignac number, because 71071121 - 26 = 71071057 is a prime.
It is a super-2 number, since 2×710711212 = 10102208480393282, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 71071093 and 71071102.
It is not an unprimeable number, because it can be changed into a prime (71071123) 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 in 15 ways as a sum of consecutive naturals, for example, 53141 + ... + 54461.
It is an arithmetic number, because the mean of its divisors is an integer number (4989228).
Almost surely, 271071121 is an apocalyptic number.
It is an amenable number.
71071121 is a deficient number, since it is larger than the sum of its proper divisors (8756527).
71071121 is a wasteful number, since it uses less digits than its factorization.
71071121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1472.
The product of its (nonzero) digits is 98, while the sum is 20.
The square root of 71071121 is about 8430.3689717592. The cubic root of 71071121 is about 414.2199912898.
Adding to 71071121 its reverse (12117017), we get a palindrome (83188138).
It can be divided in two parts, 7107 and 1121, that added together give a palindrome (8228).
The spelling of 71071121 in words is "seventy-one million, seventy-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •