Base | Representation |
---|---|
bin | 1001010101100001… |
… | …11111111010101001 |
3 | 110221022211002201111 |
4 | 10222300333322221 |
5 | 40231142030311 |
6 | 2145214150321 |
7 | 235133110444 |
oct | 45260777251 |
9 | 13838732644 |
10 | 5012455081 |
11 | 2142444767 |
12 | b7a7b23a1 |
13 | 61b5cca6a |
14 | 3579c465b |
15 | 1e50b6d21 |
hex | 12ac3fea9 |
5012455081 has 2 divisors, whose sum is σ = 5012455082. Its totient is φ = 5012455080.
The previous prime is 5012455057. The next prime is 5012455087. The reversal of 5012455081 is 1805542105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5007685225 + 4769856 = 70765^2 + 2184^2 .
It is a cyclic number.
It is not a de Polignac number, because 5012455081 - 225 = 4978900649 is a prime.
It is a super-2 number, since 2×50124550812 = 50249411878085433122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5012455087) 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, 2506227540 + 2506227541.
It is an arithmetic number, because the mean of its divisors is an integer number (2506227541).
Almost surely, 25012455081 is an apocalyptic number.
It is an amenable number.
5012455081 is a deficient number, since it is larger than the sum of its proper divisors (1).
5012455081 is an equidigital number, since it uses as much as digits as its factorization.
5012455081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8000, while the sum is 31.
The square root of 5012455081 is about 70798.6940628145. The cubic root of 5012455081 is about 1711.3946286030.
Adding to 5012455081 its reverse (1805542105), we get a palindrome (6817997186).
The spelling of 5012455081 in words is "five billion, twelve million, four hundred fifty-five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •