Base | Representation |
---|---|
bin | 100001010100100… |
… | …111011001010001 |
3 | 1102221221210200022 |
4 | 201110213121101 |
5 | 2121104133434 |
6 | 131250233225 |
7 | 16565603201 |
oct | 4124473121 |
9 | 1387853608 |
10 | 559052369 |
11 | 267630357 |
12 | 137285815 |
13 | 8ba8c925 |
14 | 54368401 |
15 | 3413022e |
hex | 21527651 |
559052369 has 4 divisors (see below), whose sum is σ = 559594596. Its totient is φ = 558510144.
The previous prime is 559052363. The next prime is 559052381. The reversal of 559052369 is 963250955.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 371718400 + 187333969 = 19280^2 + 13687^2 .
It is a cyclic number.
It is not a de Polignac number, because 559052369 - 24 = 559052353 is a prime.
It is a super-2 number, since 2×5590523692 = 625079102569024322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (559052363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 269564 + ... + 271629.
It is an arithmetic number, because the mean of its divisors is an integer number (139898649).
Almost surely, 2559052369 is an apocalyptic number.
It is an amenable number.
559052369 is a deficient number, since it is larger than the sum of its proper divisors (542227).
559052369 is a wasteful number, since it uses less digits than its factorization.
559052369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 542226.
The product of its (nonzero) digits is 364500, while the sum is 44.
The square root of 559052369 is about 23644.2882954848. The cubic root of 559052369 is about 823.7918620189.
The spelling of 559052369 in words is "five hundred fifty-nine million, fifty-two thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •