Base | Representation |
---|---|
bin | 1010000010100010000100000… |
… | …1100011100011000001101101 |
3 | 10102122102000220002200100101022 |
4 | 2200220201001203203001231 |
5 | 1220044313000142000442 |
6 | 10542312335354423525 |
7 | 301543615554366020 |
oct | 24050410143430155 |
9 | 3378360802610338 |
10 | 706471680421997 |
11 | 195115a58a12946 |
12 | 6729ab40431ba5 |
13 | 24427cbbc4b579 |
14 | c6655a9cb51b7 |
15 | 56a1e3a2173d2 |
hex | 28288418e306d |
706471680421997 has 8 divisors (see below), whose sum is σ = 807396619872576. Its totient is φ = 605546844390432.
The previous prime is 706471680421979. The next prime is 706471680422003. The reversal of 706471680421997 is 799124086174607.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 706471680421997 - 230 = 706470606680173 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 706471680421997.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (706471680424997) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10617923 + ... + 39060000.
It is an arithmetic number, because the mean of its divisors is an integer number (100924577484072).
Almost surely, 2706471680421997 is an apocalyptic number.
It is an amenable number.
706471680421997 is a deficient number, since it is larger than the sum of its proper divisors (100924939450579).
706471680421997 is a wasteful number, since it uses less digits than its factorization.
706471680421997 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51709507.
The product of its (nonzero) digits is 256048128, while the sum is 71.
The spelling of 706471680421997 in words is "seven hundred six trillion, four hundred seventy-one billion, six hundred eighty million, four hundred twenty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •