Base | Representation |
---|---|
bin | 1001011011001001… |
… | …00010001101000101 |
3 | 111001121101012200202 |
4 | 10231210202031011 |
5 | 40330214104201 |
6 | 2154015020245 |
7 | 236244130064 |
oct | 45544421505 |
9 | 14047335622 |
10 | 5059519301 |
11 | 2166a6a811 |
12 | b9250a685 |
13 | 62829ab05 |
14 | 35dd561db |
15 | 1e92b1c6b |
hex | 12d922345 |
5059519301 has 2 divisors, whose sum is σ = 5059519302. Its totient is φ = 5059519300.
The previous prime is 5059519247. The next prime is 5059519303. The reversal of 5059519301 is 1039159505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2980068100 + 2079451201 = 54590^2 + 45601^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5059519301 is a prime.
It is a Sophie Germain prime.
Together with 5059519303, 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 (5059519303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2529759650 + 2529759651.
It is an arithmetic number, because the mean of its divisors is an integer number (2529759651).
Almost surely, 25059519301 is an apocalyptic number.
It is an amenable number.
5059519301 is a deficient number, since it is larger than the sum of its proper divisors (1).
5059519301 is an equidigital number, since it uses as much as digits as its factorization.
5059519301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 30375, while the sum is 38.
The square root of 5059519301 is about 71130.2980522365. The cubic root of 5059519301 is about 1716.7343052161.
It can be divided in two parts, 50595 and 19301, that added together give a palindrome (69896).
The spelling of 5059519301 in words is "five billion, fifty-nine million, five hundred nineteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •