Base | Representation |
---|---|
bin | 1001111011100001… |
… | …10011001011111001 |
3 | 111202112112111110021 |
4 | 10331300303023321 |
5 | 41404234420131 |
6 | 2241001250441 |
7 | 246053124541 |
oct | 47560631371 |
9 | 14675474407 |
10 | 5331170041 |
11 | 2296340a5a |
12 | 1049493a21 |
13 | 66c6510b2 |
14 | 38806a321 |
15 | 213070e11 |
hex | 13dc332f9 |
5331170041 has 2 divisors, whose sum is σ = 5331170042. Its totient is φ = 5331170040.
The previous prime is 5331170011. The next prime is 5331170051. The reversal of 5331170041 is 1400711335.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4783797225 + 547372816 = 69165^2 + 23396^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5331170041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5331169988 and 5331170015.
It is not a weakly prime, because it can be changed into another prime (5331170011) 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, 2665585020 + 2665585021.
It is an arithmetic number, because the mean of its divisors is an integer number (2665585021).
Almost surely, 25331170041 is an apocalyptic number.
It is an amenable number.
5331170041 is a deficient number, since it is larger than the sum of its proper divisors (1).
5331170041 is an equidigital number, since it uses as much as digits as its factorization.
5331170041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 25.
The square root of 5331170041 is about 73014.8617816948. The cubic root of 5331170041 is about 1746.9246712860.
Adding to 5331170041 its reverse (1400711335), we get a palindrome (6731881376).
The spelling of 5331170041 in words is "five billion, three hundred thirty-one million, one hundred seventy thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •