Base | Representation |
---|---|
bin | 100001001001011… |
… | …010011011000000 |
3 | 1102202102121020212 |
4 | 201021122123000 |
5 | 2114331200043 |
6 | 131103253252 |
7 | 16531622264 |
oct | 4111323300 |
9 | 1382377225 |
10 | 556115648 |
11 | 265a04a10 |
12 | 1362aa228 |
13 | 8b2a201a |
14 | 53c020a4 |
15 | 33c50018 |
hex | 2125a6c0 |
556115648 has 56 divisors (see below), whose sum is σ = 1212738240. Its totient is φ = 250917120.
The previous prime is 556115639. The next prime is 556115653. The reversal of 556115648 is 846511655.
It is a super-3 number, since 3×5561156483 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 95015 + ... + 100697.
It is an arithmetic number, because the mean of its divisors is an integer number (21656040).
Almost surely, 2556115648 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 556115648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (606369120).
556115648 is an abundant number, since it is smaller than the sum of its proper divisors (656622592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
556115648 is a wasteful number, since it uses less digits than its factorization.
556115648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5845 (or 5835 counting only the distinct ones).
The product of its digits is 144000, while the sum is 41.
The square root of 556115648 is about 23582.1044014312. The cubic root of 556115648 is about 822.3468600062.
The spelling of 556115648 in words is "five hundred fifty-six million, one hundred fifteen thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.072 sec. • engine limits •