Base | Representation |
---|---|
bin | 1010101001001010… |
… | …11000100111110101 |
3 | 112202012222222222121 |
4 | 11110211120213311 |
5 | 43200244203441 |
6 | 2342555555541 |
7 | 261412440313 |
oct | 52445304765 |
9 | 15665888877 |
10 | 5714053621 |
11 | 2472486071 |
12 | 113575bbb1 |
13 | 700a7b923 |
14 | 3c2c570b3 |
15 | 2369a2dd1 |
hex | 1549589f5 |
5714053621 has 2 divisors, whose sum is σ = 5714053622. Its totient is φ = 5714053620.
The previous prime is 5714053619. The next prime is 5714053633. The reversal of 5714053621 is 1263504175.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4581394596 + 1132659025 = 67686^2 + 33655^2 .
It is a cyclic number.
It is not a de Polignac number, because 5714053621 - 21 = 5714053619 is a prime.
Together with 5714053619, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5714053321) 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, 2857026810 + 2857026811.
It is an arithmetic number, because the mean of its divisors is an integer number (2857026811).
Almost surely, 25714053621 is an apocalyptic number.
It is an amenable number.
5714053621 is a deficient number, since it is larger than the sum of its proper divisors (1).
5714053621 is an equidigital number, since it uses as much as digits as its factorization.
5714053621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25200, while the sum is 34.
The square root of 5714053621 is about 75591.3594334696. The cubic root of 5714053621 is about 1787.7828651478.
Adding to 5714053621 its reverse (1263504175), we get a palindrome (6977557796).
The spelling of 5714053621 in words is "five billion, seven hundred fourteen million, fifty-three thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •