Base | Representation |
---|---|
bin | 1111000011010101… |
… | …1000011011100011 |
3 | 101102120221222001001 |
4 | 3300311120123203 |
5 | 31233333304124 |
6 | 1504534252431 |
7 | 202061620561 |
oct | 36065303343 |
9 | 11376858031 |
10 | 4040525539 |
11 | 1793853706 |
12 | 9491b7117 |
13 | 4c514051b |
14 | 2a48a2a31 |
15 | 189accb44 |
hex | f0d586e3 |
4040525539 has 2 divisors, whose sum is σ = 4040525540. Its totient is φ = 4040525538.
The previous prime is 4040525477. The next prime is 4040525549. The reversal of 4040525539 is 9355250404.
4040525539 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4040525539 - 217 = 4040394467 is a prime.
It is a super-2 number, since 2×40405255392 = 32651693262622481042, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4040525498 and 4040525507.
It is not a weakly prime, because it can be changed into another prime (4040525549) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2020262769 + 2020262770.
It is an arithmetic number, because the mean of its divisors is an integer number (2020262770).
Almost surely, 24040525539 is an apocalyptic number.
4040525539 is a deficient number, since it is larger than the sum of its proper divisors (1).
4040525539 is an equidigital number, since it uses as much as digits as its factorization.
4040525539 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108000, while the sum is 37.
The square root of 4040525539 is about 63565.1283252067. The cubic root of 4040525539 is about 1592.7439058212.
The spelling of 4040525539 in words is "four billion, forty million, five hundred twenty-five thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •