Base | Representation |
---|---|
bin | 101010000000010… |
… | …001000110110101 |
3 | 1211010001010200201 |
4 | 222000101012311 |
5 | 2420401310031 |
6 | 153532240501 |
7 | 23314651156 |
oct | 5200210665 |
9 | 1733033621 |
10 | 704713141 |
11 | 331879460 |
12 | 178010131 |
13 | b2ccc732 |
14 | 6984392d |
15 | 41d03d61 |
hex | 2a0111b5 |
704713141 has 4 divisors (see below), whose sum is σ = 768777984. Its totient is φ = 640648300.
The previous prime is 704713117. The next prime is 704713147. The reversal of 704713141 is 141317407.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 704713141 - 25 = 704713109 is a prime.
It is a super-2 number, since 2×7047131412 = 993241222196171762, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (704713147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32032405 + ... + 32032426.
It is an arithmetic number, because the mean of its divisors is an integer number (192194496).
Almost surely, 2704713141 is an apocalyptic number.
It is an amenable number.
704713141 is a deficient number, since it is larger than the sum of its proper divisors (64064843).
704713141 is a wasteful number, since it uses less digits than its factorization.
704713141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64064842.
The product of its (nonzero) digits is 2352, while the sum is 28.
The square root of 704713141 is about 26546.4336776148. The cubic root of 704713141 is about 889.8923158020.
The spelling of 704713141 in words is "seven hundred four million, seven hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •