Base | Representation |
---|---|
bin | 1001101101100100… |
… | …01110011011011101 |
3 | 111110101020220000121 |
4 | 10312302032123131 |
5 | 41134302301021 |
6 | 2221220154541 |
7 | 243132101143 |
oct | 46662163335 |
9 | 14411226017 |
10 | 5214103261 |
11 | 2236252a54 |
12 | 1016238a51 |
13 | 651313303 |
14 | 3766b5593 |
15 | 207b49741 |
hex | 136c8e6dd |
5214103261 has 2 divisors, whose sum is σ = 5214103262. Its totient is φ = 5214103260.
The previous prime is 5214103231. The next prime is 5214103309. The reversal of 5214103261 is 1623014125.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3397724100 + 1816379161 = 58290^2 + 42619^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5214103261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5214103211) 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, 2607051630 + 2607051631.
It is an arithmetic number, because the mean of its divisors is an integer number (2607051631).
Almost surely, 25214103261 is an apocalyptic number.
It is an amenable number.
5214103261 is a deficient number, since it is larger than the sum of its proper divisors (1).
5214103261 is an equidigital number, since it uses as much as digits as its factorization.
5214103261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 5214103261 is about 72208.7478149289. The cubic root of 5214103261 is about 1734.0430527516.
Adding to 5214103261 its reverse (1623014125), we get a palindrome (6837117386).
The spelling of 5214103261 in words is "five billion, two hundred fourteen million, one hundred three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •