Base | Representation |
---|---|
bin | 100001011001001011… |
… | …1100100110100100101 |
3 | 20212002201210010011210 |
4 | 1002302113210310211 |
5 | 2133331233020232 |
6 | 52535525022033 |
7 | 5116042645065 |
oct | 1026227446445 |
9 | 225081703153 |
10 | 71712001317 |
11 | 2845a611aa0 |
12 | 11a94254919 |
13 | 69bb036698 |
14 | 36841433a5 |
15 | 1ceaa855cc |
hex | 10b25e4d25 |
71712001317 has 8 divisors (see below), whose sum is σ = 104308365600. Its totient is φ = 43461818960.
The previous prime is 71712001303. The next prime is 71712001331. The reversal of 71712001317 is 71310021717.
It is an interprime number because it is at equal distance from previous prime (71712001303) and next prime (71712001331).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 71712001317 - 28 = 71712001061 is a prime.
It is a super-2 number, since 2×717120013172 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (71712001117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1086545442 + ... + 1086545507.
It is an arithmetic number, because the mean of its divisors is an integer number (13038545700).
Almost surely, 271712001317 is an apocalyptic number.
It is an amenable number.
71712001317 is a deficient number, since it is larger than the sum of its proper divisors (32596364283).
71712001317 is a wasteful number, since it uses less digits than its factorization.
71712001317 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2173090963.
The product of its (nonzero) digits is 2058, while the sum is 30.
The spelling of 71712001317 in words is "seventy-one billion, seven hundred twelve million, one thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •