Base | Representation |
---|---|
bin | 11100110010101… |
… | …110011101110000 |
3 | 1020122221222011010 |
4 | 130302232131300 |
5 | 1442130401233 |
6 | 115533350520 |
7 | 14653636635 |
oct | 3462563560 |
9 | 1218858133 |
10 | 483059568 |
11 | 228746892 |
12 | 115938440 |
13 | 79103484 |
14 | 4822618c |
15 | 2c61db63 |
hex | 1ccae770 |
483059568 has 80 divisors (see below), whose sum is σ = 1294801056. Its totient is φ = 155059200.
The previous prime is 483059567. The next prime is 483059587. The reversal of 483059568 is 865950384.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (483059567) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 178030 + ... + 180722.
Almost surely, 2483059568 is an apocalyptic number.
483059568 is a gapful number since it is divisible by the number (48) 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 483059568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (647400528).
483059568 is an abundant number, since it is smaller than the sum of its proper divisors (811741488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
483059568 is a wasteful number, since it uses less digits than its factorization.
483059568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2842 (or 2836 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 48.
The square root of 483059568 is about 21978.6161529792. The cubic root of 483059568 is about 784.6335899363.
The spelling of 483059568 in words is "four hundred eighty-three million, fifty-nine thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •