Base | Representation |
---|---|
bin | 1000011101010110… |
… | …00001011110001001 |
3 | 102201110221010111202 |
4 | 10032223001132021 |
5 | 33300012022122 |
6 | 2030340033545 |
7 | 220350636653 |
oct | 41653013611 |
9 | 12643833452 |
10 | 4541126537 |
11 | 1a20390642 |
12 | a689928b5 |
13 | 574a7602c |
14 | 3111736d3 |
15 | 1b8a13e92 |
hex | 10eac1789 |
4541126537 has 2 divisors, whose sum is σ = 4541126538. Its totient is φ = 4541126536.
The previous prime is 4541126497. The next prime is 4541126539. The reversal of 4541126537 is 7356211454.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4507242496 + 33884041 = 67136^2 + 5821^2 .
It is a cyclic number.
It is not a de Polignac number, because 4541126537 - 226 = 4474017673 is a prime.
It is a super-2 number, since 2×45411265372 = 41243660450091224738, which contains 22 as substring.
Together with 4541126539, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4541126537.
It is not a weakly prime, because it can be changed into another prime (4541126539) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2270563268 + 2270563269.
It is an arithmetic number, because the mean of its divisors is an integer number (2270563269).
Almost surely, 24541126537 is an apocalyptic number.
It is an amenable number.
4541126537 is a deficient number, since it is larger than the sum of its proper divisors (1).
4541126537 is an equidigital number, since it uses as much as digits as its factorization.
4541126537 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 100800, while the sum is 38.
The square root of 4541126537 is about 67387.8812324590. The cubic root of 4541126537 is about 1655.9778921537.
The spelling of 4541126537 in words is "four billion, five hundred forty-one million, one hundred twenty-six thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •