Base | Representation |
---|---|
bin | 101010100001010… |
… | …010001011000101 |
3 | 1211201022212021201 |
4 | 222201102023011 |
5 | 2430110241021 |
6 | 154441542501 |
7 | 23451346564 |
oct | 5241221305 |
9 | 1751285251 |
10 | 713368261 |
11 | 336750151 |
12 | 17aaa4a31 |
13 | b4a400c8 |
14 | 6aa57bdb |
15 | 42963591 |
hex | 2a8522c5 |
713368261 has 2 divisors, whose sum is σ = 713368262. Its totient is φ = 713368260.
The previous prime is 713368247. The next prime is 713368277. The reversal of 713368261 is 162863317.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 557243236 + 156125025 = 23606^2 + 12495^2 .
It is a cyclic number.
It is not a de Polignac number, because 713368261 - 27 = 713368133 is a prime.
It is equal to p36909109 and since 713368261 and 36909109 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 713368261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (713368211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 356684130 + 356684131.
It is an arithmetic number, because the mean of its divisors is an integer number (356684131).
Almost surely, 2713368261 is an apocalyptic number.
It is an amenable number.
713368261 is a deficient number, since it is larger than the sum of its proper divisors (1).
713368261 is an equidigital number, since it uses as much as digits as its factorization.
713368261 is an evil number, because the sum of its binary digits is even.
The product of its digits is 36288, while the sum is 37.
The square root of 713368261 is about 26708.9546968802. The cubic root of 713368261 is about 893.5206509100.
It can be divided in two parts, 71336 and 8261, that added together give a palindrome (79597).
The spelling of 713368261 in words is "seven hundred thirteen million, three hundred sixty-eight thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •