Base | Representation |
---|---|
bin | 1001111010011110… |
… | …10110101100101001 |
3 | 111201221001001210021 |
4 | 10331033112230221 |
5 | 41400013340401 |
6 | 2240045320441 |
7 | 245615450515 |
oct | 47517265451 |
9 | 14657031707 |
10 | 5322402601 |
11 | 22913a293a |
12 | 1046566121 |
13 | 66a8a1569 |
14 | 386c27145 |
15 | 2123dd2a1 |
hex | 13d3d6b29 |
5322402601 has 4 divisors (see below), whose sum is σ = 5325597072. Its totient is φ = 5319208132.
The previous prime is 5322402599. The next prime is 5322402611. The reversal of 5322402601 is 1062042235.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5322402601 - 21 = 5322402599 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5322402611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1594735 + ... + 1598068.
It is an arithmetic number, because the mean of its divisors is an integer number (1331399268).
Almost surely, 25322402601 is an apocalyptic number.
It is an amenable number.
5322402601 is a deficient number, since it is larger than the sum of its proper divisors (3194471).
5322402601 is a wasteful number, since it uses less digits than its factorization.
5322402601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3194470.
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 5322402601 is about 72954.7983411646. The cubic root of 5322402601 is about 1745.9665038249.
Adding to 5322402601 its reverse (1062042235), we get a palindrome (6384444836).
The spelling of 5322402601 in words is "five billion, three hundred twenty-two million, four hundred two thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •