Base | Representation |
---|---|
bin | 100001011000111011… |
… | …0110010100101111001 |
3 | 20212002010121110221121 |
4 | 1002301312302211321 |
5 | 2133322033010334 |
6 | 52535020505241 |
7 | 5115606621505 |
oct | 1026166624571 |
9 | 225063543847 |
10 | 71703406969 |
11 | 28455781a27 |
12 | 11a913ab221 |
13 | 69b931787c |
14 | 3682d47305 |
15 | 1ce9e38db4 |
hex | 10b1db2979 |
71703406969 has 4 divisors (see below), whose sum is σ = 71713483380. Its totient is φ = 71693330560.
The previous prime is 71703406949. The next prime is 71703406991. The reversal of 71703406969 is 96960430717.
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 11813081344 + 59890325625 = 108688^2 + 244725^2 .
It is a cyclic number.
It is not a de Polignac number, because 71703406969 - 211 = 71703404921 is a prime.
It is a super-2 number, since 2×717034069692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (71703406909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5027524 + ... + 5041765.
It is an arithmetic number, because the mean of its divisors is an integer number (17928370845).
Almost surely, 271703406969 is an apocalyptic number.
It is an amenable number.
71703406969 is a deficient number, since it is larger than the sum of its proper divisors (10076411).
71703406969 is a wasteful number, since it uses less digits than its factorization.
71703406969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10076410.
The product of its (nonzero) digits is 1714608, while the sum is 52.
The spelling of 71703406969 in words is "seventy-one billion, seven hundred three million, four hundred six thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •