Base | Representation |
---|---|
bin | 10100100100100001111… |
… | …10000001001001111001 |
3 | 2111120101120201100012102 |
4 | 22102100332001021321 |
5 | 43040020021011210 |
6 | 1300411430553145 |
7 | 102031221533165 |
oct | 12222076011171 |
9 | 2446346640172 |
10 | 706806813305 |
11 | 25283402423a |
12 | b4b982087b5 |
13 | 51861732b18 |
14 | 262d1333ca5 |
15 | 135bb960ea5 |
hex | a490f81279 |
706806813305 has 16 divisors (see below), whose sum is σ = 892830547200. Its totient is φ = 535671999360.
The previous prime is 706806813301. The next prime is 706806813319. The reversal of 706806813305 is 503318608607.
It is a happy number.
It is not a de Polignac number, because 706806813305 - 22 = 706806813301 is a prime.
It is a Smith number, since the sum of its digits (47) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 706806813305.
It is not an unprimeable number, because it can be changed into a prime (706806813301) 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 15 ways as a sum of consecutive naturals, for example, 5746400 + ... + 5868110.
It is an arithmetic number, because the mean of its divisors is an integer number (55801909200).
Almost surely, 2706806813305 is an apocalyptic number.
It is an amenable number.
706806813305 is a deficient number, since it is larger than the sum of its proper divisors (186023733895).
706806813305 is a wasteful number, since it uses less digits than its factorization.
706806813305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182864.
The product of its (nonzero) digits is 725760, while the sum is 47.
The spelling of 706806813305 in words is "seven hundred six billion, eight hundred six million, eight hundred thirteen thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •