Base | Representation |
---|---|
bin | 100001000001001… |
… | …111101011110000 |
3 | 1102121101211011112 |
4 | 201001033223300 |
5 | 2113304141022 |
6 | 130545332452 |
7 | 16504464020 |
oct | 4101175360 |
9 | 1377354145 |
10 | 553974512 |
11 | 264782283 |
12 | 135637128 |
13 | 8aa02590 |
14 | 53805a80 |
15 | 3397a8e2 |
hex | 2104faf0 |
553974512 has 80 divisors (see below), whose sum is σ = 1398785472. Its totient is φ = 206254080.
The previous prime is 553974457. The next prime is 553974581. The reversal of 553974512 is 215479355.
It is a self number, because there is not a number n which added to its sum of digits gives 553974512.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13562 + ... + 35942.
Almost surely, 2553974512 is an apocalyptic number.
553974512 is a gapful number since it is divisible by the number (52) 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 553974512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (699392736).
553974512 is an abundant number, since it is smaller than the sum of its proper divisors (844810960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
553974512 is a wasteful number, since it uses less digits than its factorization.
553974512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22426 (or 22420 counting only the distinct ones).
The product of its digits is 189000, while the sum is 41.
The square root of 553974512 is about 23536.6631449745. The cubic root of 553974512 is about 821.2901127558.
The spelling of 553974512 in words is "five hundred fifty-three million, nine hundred seventy-four thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •