Base | Representation |
---|---|
bin | 100000001000010… |
… | …110110101100001 |
3 | 1101120100011111111 |
4 | 200020112311201 |
5 | 2100444432401 |
6 | 125253543321 |
7 | 16233643111 |
oct | 4010266541 |
9 | 1346304444 |
10 | 539061601 |
11 | 257316a61 |
12 | 130644b41 |
13 | 878b0780 |
14 | 51843041 |
15 | 324d1e51 |
hex | 20216d61 |
539061601 has 4 divisors (see below), whose sum is σ = 580527892. Its totient is φ = 497595312.
The previous prime is 539061581. The next prime is 539061629. The reversal of 539061601 is 106160935.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 106160935 = 5 ⋅21232187.
It can be written as a sum of positive squares in 2 ways, for example, as 192543376 + 346518225 = 13876^2 + 18615^2 .
It is a cyclic number.
It is not a de Polignac number, because 539061601 - 225 = 505507169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (539061101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20733126 + ... + 20733151.
It is an arithmetic number, because the mean of its divisors is an integer number (145131973).
Almost surely, 2539061601 is an apocalyptic number.
It is an amenable number.
539061601 is a deficient number, since it is larger than the sum of its proper divisors (41466291).
539061601 is a wasteful number, since it uses less digits than its factorization.
539061601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41466290.
The product of its (nonzero) digits is 4860, while the sum is 31.
The square root of 539061601 is about 23217.7001660371. The cubic root of 539061601 is about 813.8533065165.
The spelling of 539061601 in words is "five hundred thirty-nine million, sixty-one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •