Base | Representation |
---|---|
bin | 100000001010101… |
… | …101101010000001 |
3 | 1101121111112220111 |
4 | 200022231222001 |
5 | 2101124214421 |
6 | 125315111321 |
7 | 16242125134 |
oct | 4012555201 |
9 | 1347445814 |
10 | 539679361 |
11 | 2576a9101 |
12 | 1308a2541 |
13 | 87a68a00 |
14 | 5196421b |
15 | 325a4ee1 |
hex | 202ada81 |
539679361 has 9 divisors (see below), whose sum is σ = 584713731. Its totient is φ = 497886792.
The previous prime is 539679359. The next prime is 539679389. The reversal of 539679361 is 163976935.
The square root of 539679361 is 23231.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 79834225 + 459845136 = 8935^2 + 21444^2 .
It is not a de Polignac number, because 539679361 - 21 = 539679359 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (539679311) 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 8 ways as a sum of consecutive naturals, for example, 301110 + ... + 302896.
Almost surely, 2539679361 is an apocalyptic number.
539679361 is the 23231-st square number.
539679361 is the 11616-th centered octagonal number.
It is an amenable number.
539679361 is a deficient number, since it is larger than the sum of its proper divisors (45034370).
539679361 is an frugal number, since it uses more digits than its factorization.
539679361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3600 (or 1800 counting only the distinct ones).
The product of its digits is 918540, while the sum is 49.
The cubic root of 539679361 is about 814.1640774839.
Multiplying 539679361 by its sum of digits (49), we get a square (26444288689 = 1626172).
The spelling of 539679361 in words is "five hundred thirty-nine million, six hundred seventy-nine thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •