Base | Representation |
---|---|
bin | 10001000000111100000 |
3 | 1001022210111 |
4 | 2020013200 |
5 | 120320121 |
6 | 15541104 |
7 | 4511320 |
oct | 2100740 |
9 | 1038714 |
10 | 557536 |
11 | 350981 |
12 | 22a794 |
13 | 166a05 |
14 | 107280 |
15 | b02e1 |
hex | 881e0 |
557536 has 48 divisors (see below), whose sum is σ = 1330560. Its totient is φ = 224640.
The previous prime is 557533. The next prime is 557537. The reversal of 557536 is 635755.
It is a junction number, because it is equal to n+sod(n) for n = 557498 and 557507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (557533) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4191 + ... + 4321.
It is an arithmetic number, because the mean of its divisors is an integer number (27720).
2557536 is an apocalyptic number.
557536 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 557536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (665280).
557536 is an abundant number, since it is smaller than the sum of its proper divisors (773024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
557536 is a wasteful number, since it uses less digits than its factorization.
With its predecessor (557535) it forms a Ruth-Aaron pair, since the sum of their distinct prime factors is the same (159).
557536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167 (or 159 counting only the distinct ones).
The product of its digits is 15750, while the sum is 31.
The square root of 557536 is about 746.6833331473. The cubic root of 557536 is about 82.3046372192.
The spelling of 557536 in words is "five hundred fifty-seven thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •