Base | Representation |
---|---|
bin | 11100111100010… |
… | …000010100100000 |
3 | 1020211122212201110 |
4 | 130330100110200 |
5 | 1443300320121 |
6 | 120103103320 |
7 | 15014112432 |
oct | 3474202440 |
9 | 1224585643 |
10 | 485557536 |
11 | 22a0a2622 |
12 | 116741b40 |
13 | 79799469 |
14 | 486b6652 |
15 | 2c963d76 |
hex | 1cf10520 |
485557536 has 48 divisors (see below), whose sum is σ = 1349568864. Its totient is φ = 152331264.
The previous prime is 485557507. The next prime is 485557537. The reversal of 485557536 is 635755584.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×4855575362 = 471532241532782592, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (485557537) 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 7 ways as a sum of consecutive naturals, for example, 147130 + ... + 150393.
It is an arithmetic number, because the mean of its divisors is an integer number (28116018).
Almost surely, 2485557536 is an apocalyptic number.
It is an amenable number.
485557536 is an abundant number, since it is smaller than the sum of its proper divisors (864011328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
485557536 is a wasteful number, since it uses less digits than its factorization.
485557536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297553 (or 297545 counting only the distinct ones).
The product of its digits is 2520000, while the sum is 48.
The square root of 485557536 is about 22035.3701126167. The cubic root of 485557536 is about 785.9837483448.
The spelling of 485557536 in words is "four hundred eighty-five million, five hundred fifty-seven thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •