Base | Representation |
---|---|
bin | 1010000011110000… |
… | …10101101001000001 |
3 | 111221100112101020222 |
4 | 11001320111221001 |
5 | 42024431130131 |
6 | 2251510112425 |
7 | 250552260536 |
oct | 50170255101 |
9 | 14840471228 |
10 | 5400255041 |
11 | 23213375a5 |
12 | 106864b715 |
13 | 680a5c2ac |
14 | 3932d0d8d |
15 | 21916a87b |
hex | 141e15a41 |
5400255041 has 2 divisors, whose sum is σ = 5400255042. Its totient is φ = 5400255040.
The previous prime is 5400255013. The next prime is 5400255059. The reversal of 5400255041 is 1405520045.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4671039025 + 729216016 = 68345^2 + 27004^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5400255041 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5400255041.
It is not a weakly prime, because it can be changed into another prime (5400285041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2700127520 + 2700127521.
It is an arithmetic number, because the mean of its divisors is an integer number (2700127521).
Almost surely, 25400255041 is an apocalyptic number.
It is an amenable number.
5400255041 is a deficient number, since it is larger than the sum of its proper divisors (1).
5400255041 is an equidigital number, since it uses as much as digits as its factorization.
5400255041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4000, while the sum is 26.
The square root of 5400255041 is about 73486.4275972101. The cubic root of 5400255041 is about 1754.4382626562.
Adding to 5400255041 its reverse (1405520045), we get a palindrome (6805775086).
The spelling of 5400255041 in words is "five billion, four hundred million, two hundred fifty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •