Base | Representation |
---|---|
bin | 100001001001011… |
… | …111100010111111 |
3 | 1102202110200001022 |
4 | 201021133202333 |
5 | 2114332333024 |
6 | 131103534355 |
7 | 16532040422 |
oct | 4111374277 |
9 | 1382420038 |
10 | 556136639 |
11 | 265a19763 |
12 | 1362ba3bb |
13 | 8b2ab746 |
14 | 53c099b9 |
15 | 33c5635e |
hex | 2125f8bf |
556136639 has 8 divisors (see below), whose sum is σ = 562335840. Its totient is φ = 549957600.
The previous prime is 556136627. The next prime is 556136653. The reversal of 556136639 is 936631655.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 556136639 - 224 = 539359423 is a prime.
It is a super-2 number, since 2×5561366392 = 618575922476432642, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 556136639.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (556136039) 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 in 7 ways as a sum of consecutive naturals, for example, 54254 + ... + 63684.
It is an arithmetic number, because the mean of its divisors is an integer number (70291980).
Almost surely, 2556136639 is an apocalyptic number.
556136639 is a deficient number, since it is larger than the sum of its proper divisors (6199201).
556136639 is a wasteful number, since it uses less digits than its factorization.
556136639 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10081.
The product of its digits is 437400, while the sum is 44.
The square root of 556136639 is about 23582.5494592930. The cubic root of 556136639 is about 822.3572065746.
The spelling of 556136639 in words is "five hundred fifty-six million, one hundred thirty-six thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •