Base | Representation |
---|---|
bin | 101010100010011… |
… | …000101011100001 |
3 | 1211201212112102212 |
4 | 222202120223201 |
5 | 2430144011212 |
6 | 154452051505 |
7 | 23453661551 |
oct | 5242305341 |
9 | 1751775385 |
10 | 713657057 |
11 | 336928123 |
12 | 17b003b95 |
13 | b4b116a9 |
14 | 6aad1161 |
15 | 429bde22 |
hex | 2a898ae1 |
713657057 has 4 divisors (see below), whose sum is σ = 713737620. Its totient is φ = 713576496.
The previous prime is 713657053. The next prime is 713657083. The reversal of 713657057 is 750756317.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 469328896 + 244328161 = 21664^2 + 15631^2 .
It is a cyclic number.
It is not a de Polignac number, because 713657057 - 22 = 713657053 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (713657051) 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 3 ways as a sum of consecutive naturals, for example, 25082 + ... + 45347.
It is an arithmetic number, because the mean of its divisors is an integer number (178434405).
Almost surely, 2713657057 is an apocalyptic number.
It is an amenable number.
713657057 is a deficient number, since it is larger than the sum of its proper divisors (80563).
713657057 is a wasteful number, since it uses less digits than its factorization.
713657057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80562.
The product of its (nonzero) digits is 154350, while the sum is 41.
The square root of 713657057 is about 26714.3605014232. The cubic root of 713657057 is about 893.6412106031.
The spelling of 713657057 in words is "seven hundred thirteen million, six hundred fifty-seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •