Base | Representation |
---|---|
bin | 100001000100010100… |
… | …1111011111110110101 |
3 | 20210021221221002102101 |
4 | 1002020221323332311 |
5 | 2130413103443301 |
6 | 52342245142101 |
7 | 5062514333362 |
oct | 1021051737665 |
9 | 223257832371 |
10 | 71012171701 |
11 | 28130579709 |
12 | 119199ba931 |
13 | 6909056a13 |
14 | 3619211469 |
15 | 1ca93e8701 |
hex | 1088a7bfb5 |
71012171701 has 4 divisors (see below), whose sum is σ = 71014621932. Its totient is φ = 71009721472.
The previous prime is 71012171689. The next prime is 71012171717. The reversal of 71012171701 is 10717121017.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 47110702500 + 23901469201 = 217050^2 + 154601^2 .
It is a cyclic number.
It is not a de Polignac number, because 71012171701 - 29 = 71012171189 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 71012171701.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (71012171201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1181116 + ... + 1239781.
It is an arithmetic number, because the mean of its divisors is an integer number (17753655483).
Almost surely, 271012171701 is an apocalyptic number.
It is an amenable number.
71012171701 is a deficient number, since it is larger than the sum of its proper divisors (2450231).
71012171701 is a wasteful number, since it uses less digits than its factorization.
71012171701 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2450230.
The product of its (nonzero) digits is 686, while the sum is 28.
Adding to 71012171701 its reverse (10717121017), we get a palindrome (81729292718).
The spelling of 71012171701 in words is "seventy-one billion, twelve million, one hundred seventy-one thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •