Base | Representation |
---|---|
bin | 10100110000001100000… |
… | …10001001010111011000 |
3 | 2112011112210002122211022 |
4 | 22120012002021113120 |
5 | 43140324321001310 |
6 | 1303324454422012 |
7 | 102342302161250 |
oct | 12300602112730 |
9 | 2464483078738 |
10 | 713065797080 |
11 | 2554560643aa |
12 | b6244361908 |
13 | 5231b368410 |
14 | 267266ba960 |
15 | 138361a4a55 |
hex | a6060895d8 |
713065797080 has 128 divisors (see below), whose sum is σ = 1975664476800. Its totient is φ = 225556918272.
The previous prime is 713065797071. The next prime is 713065797083. The reversal of 713065797080 is 80797560317.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (713065797083) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7132076 + ... + 7231364.
It is an arithmetic number, because the mean of its divisors is an integer number (15434878725).
Almost surely, 2713065797080 is an apocalyptic number.
713065797080 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 713065797080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (987832238400).
713065797080 is an abundant number, since it is smaller than the sum of its proper divisors (1262598679720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
713065797080 is a wasteful number, since it uses less digits than its factorization.
713065797080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101293 (or 101289 counting only the distinct ones).
The product of its (nonzero) digits is 2222640, while the sum is 53.
The spelling of 713065797080 in words is "seven hundred thirteen billion, sixty-five million, seven hundred ninety-seven thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •