Base | Representation |
---|---|
bin | 101010100011010… |
… | …010010010001101 |
3 | 1211202022112002200 |
4 | 222203102102031 |
5 | 2430224034010 |
6 | 154501112113 |
7 | 23455663500 |
oct | 5243222215 |
9 | 1752275080 |
10 | 713893005 |
11 | 336a79421 |
12 | 17b0b8639 |
13 | b4b94bc7 |
14 | 6ab53137 |
15 | 42a18cc0 |
hex | 2a8d248d |
713893005 has 54 divisors (see below), whose sum is σ = 1441975626. Its totient is φ = 325777536.
The previous prime is 713893003. The next prime is 713893007. The reversal of 713893005 is 500398317.
It is an interprime number because it is at equal distance from previous prime (713893003) and next prime (713893007).
It can be written as a sum of positive squares in 3 ways, for example, as 1483524 + 712409481 = 1218^2 + 26691^2 .
It is not a de Polignac number, because 713893005 - 21 = 713893003 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (713893003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 1254361 + ... + 1254929.
Almost surely, 2713893005 is an apocalyptic number.
It is an amenable number.
713893005 is an abundant number, since it is smaller than the sum of its proper divisors (728082621).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
713893005 is an equidigital number, since it uses as much as digits as its factorization.
713893005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1163 (or 584 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The square root of 713893005 is about 26718.7762631450. The cubic root of 713893005 is about 893.7396844295.
The spelling of 713893005 in words is "seven hundred thirteen million, eight hundred ninety-three thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •