Base | Representation |
---|---|
bin | 11110000101110… |
… | …110010000000000 |
3 | 1022011222000012020 |
4 | 132011312100000 |
5 | 2013220140113 |
6 | 122032401440 |
7 | 15340102110 |
oct | 3605662000 |
9 | 1264860166 |
10 | 504849408 |
11 | 239a79918 |
12 | 1210a6280 |
13 | 8079247b |
14 | 4b099040 |
15 | 2e4c5023 |
hex | 1e176400 |
504849408 has 176 divisors, whose sum is σ = 1629477504. Its totient is φ = 135659520.
The previous prime is 504849407. The next prime is 504849413. The reversal of 504849408 is 804948405.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a self number, because there is not a number n which added to its sum of digits gives 504849408.
It is not an unprimeable number, because it can be changed into a prime (504849407) 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 15 ways as a sum of consecutive naturals, for example, 364878 + ... + 366258.
Almost surely, 2504849408 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 504849408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (814738752).
504849408 is an abundant number, since it is smaller than the sum of its proper divisors (1124628096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
504849408 is a wasteful number, since it uses less digits than its factorization.
504849408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1428 (or 1410 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 42.
The square root of 504849408 is about 22468.8541763927. The cubic root of 504849408 is about 796.2582598438.
The spelling of 504849408 in words is "five hundred four million, eight hundred forty-nine thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •