Base | Representation |
---|---|
bin | 1001110011110100… |
… | …01011110100011101 |
3 | 111121000220000011011 |
4 | 10321322023310131 |
5 | 41241212140443 |
6 | 2230331455221 |
7 | 244336456501 |
oct | 47172136435 |
9 | 14530800134 |
10 | 5266521373 |
11 | 22628a5503 |
12 | 102b8b7511 |
13 | 65c137249 |
14 | 37d63c301 |
15 | 20c550b9d |
hex | 139e8bd1d |
5266521373 has 2 divisors, whose sum is σ = 5266521374. Its totient is φ = 5266521372.
The previous prime is 5266521371. The next prime is 5266521419. The reversal of 5266521373 is 3731256625.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3464264164 + 1802257209 = 58858^2 + 42453^2 .
It is a cyclic number.
It is not a de Polignac number, because 5266521373 - 21 = 5266521371 is a prime.
Together with 5266521371, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5266521371) 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, 2633260686 + 2633260687.
It is an arithmetic number, because the mean of its divisors is an integer number (2633260687).
Almost surely, 25266521373 is an apocalyptic number.
It is an amenable number.
5266521373 is a deficient number, since it is larger than the sum of its proper divisors (1).
5266521373 is an equidigital number, since it uses as much as digits as its factorization.
5266521373 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 226800, while the sum is 40.
The square root of 5266521373 is about 72570.8024828167. The cubic root of 5266521373 is about 1739.8345477287.
Adding to 5266521373 its reverse (3731256625), we get a palindrome (8997777998).
The spelling of 5266521373 in words is "five billion, two hundred sixty-six million, five hundred twenty-one thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •