Base | Representation |
---|---|
bin | 10100100000110010111… |
… | …10010010110001100001 |
3 | 2111101012212022200120001 |
4 | 22100121132102301201 |
5 | 43021413303230121 |
6 | 1255440453020001 |
7 | 101630436136216 |
oct | 12203136226141 |
9 | 2441185280501 |
10 | 704802008161 |
11 | 2519a53a5489 |
12 | b4718924601 |
13 | 516022955a4 |
14 | 26180d87b0d |
15 | 1350094e991 |
hex | a419792c61 |
704802008161 has 2 divisors, whose sum is σ = 704802008162. Its totient is φ = 704802008160.
The previous prime is 704802008147. The next prime is 704802008171. The reversal of 704802008161 is 161800208407.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 543795630625 + 161006377536 = 737425^2 + 401256^2 .
It is an emirp because it is prime and its reverse (161800208407) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 704802008161 - 29 = 704802007649 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 704802008161.
It is not a weakly prime, because it can be changed into another prime (704802008111) 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 as a sum of consecutive naturals, namely, 352401004080 + 352401004081.
It is an arithmetic number, because the mean of its divisors is an integer number (352401004081).
Almost surely, 2704802008161 is an apocalyptic number.
It is an amenable number.
704802008161 is a deficient number, since it is larger than the sum of its proper divisors (1).
704802008161 is an equidigital number, since it uses as much as digits as its factorization.
704802008161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21504, while the sum is 37.
The spelling of 704802008161 in words is "seven hundred four billion, eight hundred two million, eight thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •