Base | Representation |
---|---|
bin | 1001010101100110… |
… | …00101111011110101 |
3 | 110221100211222201121 |
4 | 10222303011323311 |
5 | 40231312112041 |
6 | 2145234023541 |
7 | 235140555034 |
oct | 45263057365 |
9 | 13840758647 |
10 | 5013004021 |
11 | 214278a133 |
12 | b7aa17bb1 |
13 | 61b76288c |
14 | 357ac871b |
15 | 1e51747d1 |
hex | 12acc5ef5 |
5013004021 has 2 divisors, whose sum is σ = 5013004022. Its totient is φ = 5013004020.
The previous prime is 5013003991. The next prime is 5013004069. The reversal of 5013004021 is 1204003105.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3890016900 + 1122987121 = 62370^2 + 33511^2 .
It is a cyclic number.
It is not a de Polignac number, because 5013004021 - 225 = 4979449589 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5013003986 and 5013004004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5013004621) 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, 2506502010 + 2506502011.
It is an arithmetic number, because the mean of its divisors is an integer number (2506502011).
Almost surely, 25013004021 is an apocalyptic number.
It is an amenable number.
5013004021 is a deficient number, since it is larger than the sum of its proper divisors (1).
5013004021 is an equidigital number, since it uses as much as digits as its factorization.
5013004021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 5013004021 is about 70802.5707231030. The cubic root of 5013004021 is about 1711.4571008952.
Adding to 5013004021 its reverse (1204003105), we get a palindrome (6217007126).
The spelling of 5013004021 in words is "five billion, thirteen million, four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •