Base | Representation |
---|---|
bin | 1001101110011101… |
… | …10101010001111111 |
3 | 111110220100212221122 |
4 | 10313032311101333 |
5 | 41143212234211 |
6 | 2222045021155 |
7 | 243252613463 |
oct | 46716652177 |
9 | 14426325848 |
10 | 5221602431 |
11 | 223a505211 |
12 | 10188547bb |
13 | 652a3a7a6 |
14 | 3776a84a3 |
15 | 20862b6db |
hex | 1373b547f |
5221602431 has 2 divisors, whose sum is σ = 5221602432. Its totient is φ = 5221602430.
The previous prime is 5221602409. The next prime is 5221602433. The reversal of 5221602431 is 1342061225.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5221602431 - 214 = 5221586047 is a prime.
It is a super-2 number, since 2×52216024312 = 54530263894850219522, which contains 22 as substring.
Together with 5221602433, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5221602431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5221602433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2610801215 + 2610801216.
It is an arithmetic number, because the mean of its divisors is an integer number (2610801216).
Almost surely, 25221602431 is an apocalyptic number.
5221602431 is a deficient number, since it is larger than the sum of its proper divisors (1).
5221602431 is an equidigital number, since it uses as much as digits as its factorization.
5221602431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 5221602431 is about 72260.6561760963. The cubic root of 5221602431 is about 1734.8739821048.
Adding to 5221602431 its reverse (1342061225), we get a palindrome (6563663656).
The spelling of 5221602431 in words is "five billion, two hundred twenty-one million, six hundred two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •