Base | Representation |
---|---|
bin | 10100100011000011101… |
… | …10101101000010110100 |
3 | 2111111100111100111101220 |
4 | 22101201312231002310 |
5 | 43031410142214042 |
6 | 1300201152550340 |
7 | 102002513046303 |
oct | 12214166550264 |
9 | 2444314314356 |
10 | 706016366772 |
11 | 252468919042 |
12 | b49b75523b0 |
13 | 51766a46492 |
14 | 2625837443a |
15 | 135723748ec |
hex | a461dad0b4 |
706016366772 has 96 divisors (see below), whose sum is σ = 1784108737152. Its totient is φ = 216469733376.
The previous prime is 706016366761. The next prime is 706016366801. The reversal of 706016366772 is 277663610607.
It is a super-2 number, since 2×7060163667722 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2651643 + ... + 2905725.
It is an arithmetic number, because the mean of its divisors is an integer number (18584466012).
Almost surely, 2706016366772 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 706016366772, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (892054368576).
706016366772 is an abundant number, since it is smaller than the sum of its proper divisors (1078092370380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
706016366772 is a wasteful number, since it uses less digits than its factorization.
706016366772 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 254417 (or 254415 counting only the distinct ones).
The product of its (nonzero) digits is 2667168, while the sum is 51.
The spelling of 706016366772 in words is "seven hundred six billion, sixteen million, three hundred sixty-six thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •