Base | Representation |
---|---|
bin | 1001110011101010… |
… | …10101110001101101 |
3 | 111120221111111010111 |
4 | 10321311111301231 |
5 | 41240401021222 |
6 | 2230244340021 |
7 | 244322620165 |
oct | 47165256155 |
9 | 14527444114 |
10 | 5265251437 |
11 | 2262108376 |
12 | 102b3a4611 |
13 | 65bab11c4 |
14 | 37d3cb5a5 |
15 | 20c39e777 |
hex | 139d55c6d |
5265251437 has 2 divisors, whose sum is σ = 5265251438. Its totient is φ = 5265251436.
The previous prime is 5265251413. The next prime is 5265251449. The reversal of 5265251437 is 7341525625.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5225988681 + 39262756 = 72291^2 + 6266^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5265251437 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5265251437.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5265251477) 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, 2632625718 + 2632625719.
It is an arithmetic number, because the mean of its divisors is an integer number (2632625719).
Almost surely, 25265251437 is an apocalyptic number.
It is an amenable number.
5265251437 is a deficient number, since it is larger than the sum of its proper divisors (1).
5265251437 is an equidigital number, since it uses as much as digits as its factorization.
5265251437 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 252000, while the sum is 40.
The square root of 5265251437 is about 72562.0523207551. The cubic root of 5265251437 is about 1739.6946922158.
The spelling of 5265251437 in words is "five billion, two hundred sixty-five million, two hundred fifty-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •