Base | Representation |
---|---|
bin | 101010100000110… |
… | …011100001100101 |
3 | 1211201002111002020 |
4 | 222200303201211 |
5 | 2430042231400 |
6 | 154435133353 |
7 | 23450314566 |
oct | 5240634145 |
9 | 1751074066 |
10 | 713242725 |
11 | 3366748a8 |
12 | 17aa44259 |
13 | b49c7c20 |
14 | 6aa2416d |
15 | 4293b2a0 |
hex | 2a833865 |
713242725 has 24 divisors (see below), whose sum is σ = 1269939552. Its totient is φ = 351134400.
The previous prime is 713242723. The next prime is 713242727. The reversal of 713242725 is 527242317.
It is an interprime number because it is at equal distance from previous prime (713242723) and next prime (713242727).
It is not a de Polignac number, because 713242725 - 21 = 713242723 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 (713242721) 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 23 ways as a sum of consecutive naturals, for example, 364791 + ... + 366740.
It is an arithmetic number, because the mean of its divisors is an integer number (52914148).
Almost surely, 2713242725 is an apocalyptic number.
713242725 is a gapful number since it is divisible by the number (75) formed by its first and last digit.
It is an amenable number.
713242725 is a deficient number, since it is larger than the sum of its proper divisors (556696827).
713242725 is a wasteful number, since it uses less digits than its factorization.
713242725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 731557 (or 731552 counting only the distinct ones).
The product of its digits is 23520, while the sum is 33.
The square root of 713242725 is about 26706.6045202306. The cubic root of 713242725 is about 893.4682349771.
The spelling of 713242725 in words is "seven hundred thirteen million, two hundred forty-two thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •