Base | Representation |
---|---|
bin | 1001011010000100… |
… | …01001011101010001 |
3 | 111000222102020110021 |
4 | 10231002021131101 |
5 | 40320412130131 |
6 | 2153053503441 |
7 | 236104404331 |
oct | 45502113521 |
9 | 14028366407 |
10 | 5050505041 |
11 | 216197320a |
12 | b8b4a1b81 |
13 | 626462b2a |
14 | 35ca8b0c1 |
15 | 1e85d0e11 |
hex | 12d089751 |
5050505041 has 2 divisors, whose sum is σ = 5050505042. Its totient is φ = 5050505040.
The previous prime is 5050505021. The next prime is 5050505059. The reversal of 5050505041 is 1405050505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3761982225 + 1288522816 = 61335^2 + 35896^2 .
It is a cyclic number.
It is not a de Polignac number, because 5050505041 - 223 = 5042116433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5050504997 and 5050505015.
It is not a weakly prime, because it can be changed into another prime (5050505021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2525252520 + 2525252521.
It is an arithmetic number, because the mean of its divisors is an integer number (2525252521).
Almost surely, 25050505041 is an apocalyptic number.
It is an amenable number.
5050505041 is a deficient number, since it is larger than the sum of its proper divisors (1).
5050505041 is an equidigital number, since it uses as much as digits as its factorization.
5050505041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2500, while the sum is 25.
The square root of 5050505041 is about 71066.9053849962. The cubic root of 5050505041 is about 1715.7141629240.
Adding to 5050505041 its reverse (1405050505), we get a palindrome (6455555546).
It can be divided in two parts, 505050504 and 1, that added together give a palindrome (505050505).
The spelling of 5050505041 in words is "five billion, fifty million, five hundred five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •