Base | Representation |
---|---|
bin | 1001100000010010… |
… | …00010010000011001 |
3 | 111011121112002012012 |
4 | 10300021002100121 |
5 | 40422234022301 |
6 | 2202155155305 |
7 | 240306512606 |
oct | 46011022031 |
9 | 14147462165 |
10 | 5102642201 |
11 | 2189343678 |
12 | ba4a45b35 |
13 | 6341b8c17 |
14 | 36597d6ad |
15 | 1ece7debb |
hex | 130242419 |
5102642201 has 2 divisors, whose sum is σ = 5102642202. Its totient is φ = 5102642200.
The previous prime is 5102642197. The next prime is 5102642203. The reversal of 5102642201 is 1022462015.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3578910976 + 1523731225 = 59824^2 + 39035^2 .
It is a cyclic number.
It is not a de Polignac number, because 5102642201 - 22 = 5102642197 is a prime.
It is a super-3 number, since 3×51026422013 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
Together with 5102642203, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (5102642203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2551321100 + 2551321101.
It is an arithmetic number, because the mean of its divisors is an integer number (2551321101).
Almost surely, 25102642201 is an apocalyptic number.
It is an amenable number.
5102642201 is a deficient number, since it is larger than the sum of its proper divisors (1).
5102642201 is an equidigital number, since it uses as much as digits as its factorization.
5102642201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 960, while the sum is 23.
The square root of 5102642201 is about 71432.7809972424. The cubic root of 5102642201 is about 1721.5978257614.
The spelling of 5102642201 in words is "five billion, one hundred two million, six hundred forty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •