Base | Representation |
---|---|
bin | 1001010101101000… |
… | …00110111110111101 |
3 | 110221101100112012202 |
4 | 10222310012332331 |
5 | 40231344123321 |
6 | 2145243441245 |
7 | 235143044603 |
oct | 45264067675 |
9 | 13841315182 |
10 | 5013270461 |
11 | 2142951331 |
12 | b7ab26225 |
13 | 61b826c34 |
14 | 357b57873 |
15 | 1e51c870b |
hex | 12ad06fbd |
5013270461 has 2 divisors, whose sum is σ = 5013270462. Its totient is φ = 5013270460.
The previous prime is 5013270443. The next prime is 5013270499. The reversal of 5013270461 is 1640723105.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2535122500 + 2478147961 = 50350^2 + 49781^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5013270461 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5013270161) 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, 2506635230 + 2506635231.
It is an arithmetic number, because the mean of its divisors is an integer number (2506635231).
Almost surely, 25013270461 is an apocalyptic number.
It is an amenable number.
5013270461 is a deficient number, since it is larger than the sum of its proper divisors (1).
5013270461 is an equidigital number, since it uses as much as digits as its factorization.
5013270461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 29.
The square root of 5013270461 is about 70804.4522682013. The cubic root of 5013270461 is about 1711.4874215405.
Adding to 5013270461 its reverse (1640723105), we get a palindrome (6653993566).
The spelling of 5013270461 in words is "five billion, thirteen million, two hundred seventy thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •