Base | Representation |
---|---|
bin | 1001110000110100… |
… | …01010011110110101 |
3 | 111112021112011121122 |
4 | 10320122022132311 |
5 | 41213241200234 |
6 | 2224032153325 |
7 | 243612511664 |
oct | 47032123665 |
9 | 14467464548 |
10 | 5241350069 |
11 | 224a67297a |
12 | 1023398845 |
13 | 656b63097 |
14 | 37a168ddb |
15 | 20a22c92e |
hex | 13868a7b5 |
5241350069 has 2 divisors, whose sum is σ = 5241350070. Its totient is φ = 5241350068.
The previous prime is 5241350027. The next prime is 5241350117. The reversal of 5241350069 is 9600531425.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5229169969 + 12180100 = 72313^2 + 3490^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5241350069 is a prime.
It is a super-2 number, since 2×52413500692 = 54943501091612609522, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5241350269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2620675034 + 2620675035.
It is an arithmetic number, because the mean of its divisors is an integer number (2620675035).
Almost surely, 25241350069 is an apocalyptic number.
It is an amenable number.
5241350069 is a deficient number, since it is larger than the sum of its proper divisors (1).
5241350069 is an equidigital number, since it uses as much as digits as its factorization.
5241350069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 35.
The square root of 5241350069 is about 72397.1689294547. The cubic root of 5241350069 is about 1737.0582774009.
The spelling of 5241350069 in words is "five billion, two hundred forty-one million, three hundred fifty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •