Base | Representation |
---|---|
bin | 1001111010110000… |
… | …01010101111101101 |
3 | 111202002101102222102 |
4 | 10331120022233231 |
5 | 41401111303231 |
6 | 2240211024445 |
7 | 245644212302 |
oct | 47530125755 |
9 | 14662342872 |
10 | 5324712941 |
11 | 2292730709 |
12 | 104729b125 |
13 | 66b200022 |
14 | 3872690a9 |
15 | 2126e7acb |
hex | 13d60abed |
5324712941 has 2 divisors, whose sum is σ = 5324712942. Its totient is φ = 5324712940.
The previous prime is 5324712937. The next prime is 5324712949. The reversal of 5324712941 is 1492174235.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3720390025 + 1604322916 = 60995^2 + 40054^2 .
It is a cyclic number.
It is not a de Polignac number, because 5324712941 - 22 = 5324712937 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5324712895 and 5324712904.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5324712949) 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, 2662356470 + 2662356471.
It is an arithmetic number, because the mean of its divisors is an integer number (2662356471).
Almost surely, 25324712941 is an apocalyptic number.
It is an amenable number.
5324712941 is a deficient number, since it is larger than the sum of its proper divisors (1).
5324712941 is an equidigital number, since it uses as much as digits as its factorization.
5324712941 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 60480, while the sum is 38.
The square root of 5324712941 is about 72970.6306742651. The cubic root of 5324712941 is about 1746.2190960617.
The spelling of 5324712941 in words is "five billion, three hundred twenty-four million, seven hundred twelve thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •