Base | Representation |
---|---|
bin | 1010011010110101… |
… | …00011100101010101 |
3 | 112102211200011221102 |
4 | 11031122203211111 |
5 | 42424001240141 |
6 | 2323021555445 |
7 | 255422204144 |
oct | 51532434525 |
9 | 15384604842 |
10 | 5593774421 |
11 | 24105a3574 |
12 | 1101415b85 |
13 | 6b1b878c1 |
14 | 3b0ca775b |
15 | 22b14499b |
hex | 14d6a3955 |
5593774421 has 2 divisors, whose sum is σ = 5593774422. Its totient is φ = 5593774420.
The previous prime is 5593774397. The next prime is 5593774423. The reversal of 5593774421 is 1244773955.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5581733521 + 12040900 = 74711^2 + 3470^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5593774421 is a prime.
It is a Sophie Germain prime.
Together with 5593774423, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5593774423) 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, 2796887210 + 2796887211.
It is an arithmetic number, because the mean of its divisors is an integer number (2796887211).
Almost surely, 25593774421 is an apocalyptic number.
It is an amenable number.
5593774421 is a deficient number, since it is larger than the sum of its proper divisors (1).
5593774421 is an equidigital number, since it uses as much as digits as its factorization.
5593774421 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1058400, while the sum is 47.
The square root of 5593774421 is about 74791.5397688803. The cubic root of 5593774421 is about 1775.1496979876.
The spelling of 5593774421 in words is "five billion, five hundred ninety-three million, seven hundred seventy-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •