Base | Representation |
---|---|
bin | 1001010101101111… |
… | …10011101100001101 |
3 | 110221110011210012002 |
4 | 10222313303230031 |
5 | 40232121140023 |
6 | 2145320322045 |
7 | 235154223356 |
oct | 45267635415 |
9 | 13843153162 |
10 | 5014240013 |
11 | 2143453812 |
12 | b7b313325 |
13 | 61baa6333 |
14 | 357d2ad2d |
15 | 1e531ab28 |
hex | 12adf3b0d |
5014240013 has 2 divisors, whose sum is σ = 5014240014. Its totient is φ = 5014240012.
The previous prime is 5014239943. The next prime is 5014240031. The reversal of 5014240013 is 3100424105.
Together with next prime (5014240031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4428503209 + 585736804 = 66547^2 + 24202^2 .
It is a cyclic number.
It is not a de Polignac number, because 5014240013 - 28 = 5014239757 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5014240093) 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, 2507120006 + 2507120007.
It is an arithmetic number, because the mean of its divisors is an integer number (2507120007).
Almost surely, 25014240013 is an apocalyptic number.
It is an amenable number.
5014240013 is a deficient number, since it is larger than the sum of its proper divisors (1).
5014240013 is an equidigital number, since it uses as much as digits as its factorization.
5014240013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 5014240013 is about 70811.2986252900. The cubic root of 5014240013 is about 1711.5977466669.
Adding to 5014240013 its reverse (3100424105), we get a palindrome (8114664118).
The spelling of 5014240013 in words is "five billion, fourteen million, two hundred forty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •