Base | Representation |
---|---|
bin | 11110001011101… |
… | …011011101000000 |
3 | 1022021211200002112 |
4 | 132023223131000 |
5 | 2014113044143 |
6 | 122125234452 |
7 | 15356066561 |
oct | 3613533500 |
9 | 1267750075 |
10 | 506378048 |
11 | 23a923360 |
12 | 121702a28 |
13 | 80ba91a7 |
14 | 4b376168 |
15 | 2e6c7e18 |
hex | 1e2eb740 |
506378048 has 112 divisors (see below), whose sum is σ = 1201521600. Its totient is φ = 209018880.
The previous prime is 506378029. The next prime is 506378107. The reversal of 506378048 is 840873605.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 506377996 and 506378014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 346343 + ... + 347801.
Almost surely, 2506378048 is an apocalyptic number.
506378048 is a gapful number since it is divisible by the number (58) 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 506378048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (600760800).
506378048 is an abundant number, since it is smaller than the sum of its proper divisors (695143552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506378048 is a wasteful number, since it uses less digits than its factorization.
506378048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1528 (or 1518 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 41.
The square root of 506378048 is about 22502.8453312020. The cubic root of 506378048 is about 797.0611169283.
It can be divided in two parts, 50637 and 8048, that added together give a palindrome (58685).
The spelling of 506378048 in words is "five hundred six million, three hundred seventy-eight thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •