Base | Representation |
---|---|
bin | 1010101001000100… |
… | …11110100010111101 |
3 | 112202011120021111011 |
4 | 11110202132202331 |
5 | 43200100311303 |
6 | 2342531355221 |
7 | 261403114252 |
oct | 52442364275 |
9 | 15664507434 |
10 | 5713291453 |
11 | 2472005481 |
12 | 1135452b11 |
13 | 700872a3c |
14 | 3c2ad9429 |
15 | 2368a216d |
hex | 15489e8bd |
5713291453 has 2 divisors, whose sum is σ = 5713291454. Its totient is φ = 5713291452.
The previous prime is 5713291343. The next prime is 5713291481. The reversal of 5713291453 is 3541923175.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4011068889 + 1702222564 = 63333^2 + 41258^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5713291453 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5713291153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2856645726 + 2856645727.
It is an arithmetic number, because the mean of its divisors is an integer number (2856645727).
Almost surely, 25713291453 is an apocalyptic number.
It is an amenable number.
5713291453 is a deficient number, since it is larger than the sum of its proper divisors (1).
5713291453 is an equidigital number, since it uses as much as digits as its factorization.
5713291453 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 113400, while the sum is 40.
The square root of 5713291453 is about 75586.3178955028. The cubic root of 5713291453 is about 1787.7033739162.
The spelling of 5713291453 in words is "five billion, seven hundred thirteen million, two hundred ninety-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •