Base | Representation |
---|---|
bin | 101100110100110001… |
… | …011000110000000000 |
3 | 11121020021002102111201 |
4 | 230310301120300000 |
5 | 1242032240030140 |
6 | 34035520550544 |
7 | 3322464160210 |
oct | 546461306000 |
9 | 147207072451 |
10 | 48130001920 |
11 | 194591498a0 |
12 | 93b2782454 |
13 | 4700511ca0 |
14 | 2488236240 |
15 | 13ba61149a |
hex | b34c58c00 |
48130001920 has 352 divisors, whose sum is σ = 155033819136. Its totient is φ = 13846118400.
The previous prime is 48130001897. The next prime is 48130001947. The reversal of 48130001920 is 2910003184.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (352).
It is a Harshad number since it is a multiple of its sum of digits (28).
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 31 ways as a sum of consecutive naturals, for example, 5120425 + ... + 5129815.
Almost surely, 248130001920 is an apocalyptic number.
48130001920 is a gapful number since it is divisible by the number (40) 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 48130001920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77516909568).
48130001920 is an abundant number, since it is smaller than the sum of its proper divisors (106903817216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48130001920 is a wasteful number, since it uses less digits than its factorization.
48130001920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9447 (or 9429 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 28.
The spelling of 48130001920 in words is "forty-eight billion, one hundred thirty million, one thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •