Base | Representation |
---|---|
bin | 1011101001001111… |
… | …11101100010101001 |
3 | 121010200111012001021 |
4 | 11310213331202221 |
5 | 100300402200131 |
6 | 2512201252441 |
7 | 310630503121 |
oct | 56447754251 |
9 | 17120435037 |
10 | 6251600041 |
11 | 2718957705 |
12 | 1265794121 |
13 | 78824b82b |
14 | 4343c3c81 |
15 | 268c85e11 |
hex | 1749fd8a9 |
6251600041 has 2 divisors, whose sum is σ = 6251600042. Its totient is φ = 6251600040.
The previous prime is 6251599987. The next prime is 6251600059. The reversal of 6251600041 is 1400061526.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4163475625 + 2088124416 = 64525^2 + 45696^2 .
It is a cyclic number.
It is not a de Polignac number, because 6251600041 - 223 = 6243211433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6251599979 and 6251600015.
It is not a weakly prime, because it can be changed into another prime (6251630041) 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 as a sum of consecutive naturals, namely, 3125800020 + 3125800021.
It is an arithmetic number, because the mean of its divisors is an integer number (3125800021).
Almost surely, 26251600041 is an apocalyptic number.
It is an amenable number.
6251600041 is a deficient number, since it is larger than the sum of its proper divisors (1).
6251600041 is an equidigital number, since it uses as much as digits as its factorization.
6251600041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 6251600041 is about 79067.0604044440. The cubic root of 6251600041 is about 1842.1729252801.
Adding to 6251600041 its reverse (1400061526), we get a palindrome (7651661567).
The spelling of 6251600041 in words is "six billion, two hundred fifty-one million, six hundred thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •