Base | Representation |
---|---|
bin | 1001010100101000… |
… | …00100111001000001 |
3 | 110220210112220110002 |
4 | 10222110010321001 |
5 | 40222221421111 |
6 | 2144343445345 |
7 | 235011502202 |
oct | 45224047101 |
9 | 13823486402 |
10 | 5004873281 |
11 | 2139136411 |
12 | b78156855 |
13 | 619b76aa5 |
14 | 3569ad5a9 |
15 | 1e45ba63b |
hex | 12a504e41 |
5004873281 has 2 divisors, whose sum is σ = 5004873282. Its totient is φ = 5004873280.
The previous prime is 5004873271. The next prime is 5004873317. The reversal of 5004873281 is 1823784005.
5004873281 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4583967025 + 420906256 = 67705^2 + 20516^2 .
It is a cyclic number.
It is not a de Polignac number, because 5004873281 - 218 = 5004611137 is a prime.
It is a super-2 number, since 2×50048732812 = 50097513117735409922, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (5004873221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2502436640 + 2502436641.
It is an arithmetic number, because the mean of its divisors is an integer number (2502436641).
Almost surely, 25004873281 is an apocalyptic number.
It is an amenable number.
5004873281 is a deficient number, since it is larger than the sum of its proper divisors (1).
5004873281 is an equidigital number, since it uses as much as digits as its factorization.
5004873281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 53760, while the sum is 38.
The square root of 5004873281 is about 70745.1290266687. The cubic root of 5004873281 is about 1710.5313125049.
The spelling of 5004873281 in words is "five billion, four million, eight hundred seventy-three thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •