Base | Representation |
---|---|
bin | 10100100000100111110… |
… | …11110100011110000001 |
3 | 2111100222101110201000121 |
4 | 22100103323310132001 |
5 | 43021221011210212 |
6 | 1255423333220241 |
7 | 101625230250325 |
oct | 12202373643601 |
9 | 2440871421017 |
10 | 704709085057 |
11 | 2519579a7a2a |
12 | b46b1791681 |
13 | 515b8c5bcc3 |
14 | 261728b9985 |
15 | 134e76e6d07 |
hex | a413ef4781 |
704709085057 has 8 divisors (see below), whose sum is σ = 705663134496. Its totient is φ = 703755185952.
The previous prime is 704709085049. The next prime is 704709085109. The reversal of 704709085057 is 750580907407.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 704709085057 - 23 = 704709085049 is a prime.
It is a super-2 number, since 2×7047090850572 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 704709084995 and 704709085013.
It is not an unprimeable number, because it can be changed into a prime (704709085027) 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 7 ways as a sum of consecutive naturals, for example, 11859573 + ... + 11918845.
It is an arithmetic number, because the mean of its divisors is an integer number (88207891812).
Almost surely, 2704709085057 is an apocalyptic number.
It is an amenable number.
704709085057 is a deficient number, since it is larger than the sum of its proper divisors (954049439).
704709085057 is a wasteful number, since it uses less digits than its factorization.
704709085057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75167.
The product of its (nonzero) digits is 2469600, while the sum is 52.
The spelling of 704709085057 in words is "seven hundred four billion, seven hundred nine million, eighty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •