Base | Representation |
---|---|
bin | 1001111001100011… |
… | …10100010001011101 |
3 | 111201101110200010211 |
4 | 10330301310101131 |
5 | 41341023100141 |
6 | 2235211332421 |
7 | 245462600611 |
oct | 47461642135 |
9 | 14641420124 |
10 | 5314659421 |
11 | 2287a94315 |
12 | 1043a51111 |
13 | 6690bccb6 |
14 | 385bad341 |
15 | 2118add81 |
hex | 13cc7445d |
5314659421 has 2 divisors, whose sum is σ = 5314659422. Its totient is φ = 5314659420.
The previous prime is 5314659419. The next prime is 5314659443. The reversal of 5314659421 is 1249564135.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4901960196 + 412699225 = 70014^2 + 20315^2 .
It is a cyclic number.
It is not a de Polignac number, because 5314659421 - 21 = 5314659419 is a prime.
It is a super-2 number, since 2×53146594212 = 56491209522448110482, which contains 22 as substring.
Together with 5314659419, 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 (5314650421) 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, 2657329710 + 2657329711.
It is an arithmetic number, because the mean of its divisors is an integer number (2657329711).
Almost surely, 25314659421 is an apocalyptic number.
It is an amenable number.
5314659421 is a deficient number, since it is larger than the sum of its proper divisors (1).
5314659421 is an equidigital number, since it uses as much as digits as its factorization.
5314659421 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 129600, while the sum is 40.
The square root of 5314659421 is about 72901.7106863755. The cubic root of 5314659421 is about 1745.1193992788.
The spelling of 5314659421 in words is "five billion, three hundred fourteen million, six hundred fifty-nine thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •