Base | Representation |
---|---|
bin | 101101001000110011… |
… | …101100101001000000 |
3 | 11122002200121121201200 |
4 | 231020303230221000 |
5 | 1243224313331000 |
6 | 34133125501200 |
7 | 3334015331460 |
oct | 551063545100 |
9 | 148080547650 |
10 | 48466152000 |
11 | 19610974382 |
12 | 9487271800 |
13 | 4755059166 |
14 | 24bab39ba0 |
15 | 13d9db1500 |
hex | b48ceca40 |
48466152000 has 1344 divisors, whose sum is σ = 214220657664. Its totient is φ = 10218700800.
The previous prime is 48466151971. The next prime is 48466152019. The reversal of 48466152000 is 25166484.
48466152000 is a `hidden beast` number, since 48 + 466 + 152 + 0 + 0 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (1344).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 428903944 + ... + 428904056.
Almost surely, 248466152000 is an apocalyptic number.
48466152000 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 48466152000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107110328832).
48466152000 is an abundant number, since it is smaller than the sum of its proper divisors (165754505664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48466152000 is a wasteful number, since it uses less digits than its factorization.
48466152000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213 (or 190 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 36.
The spelling of 48466152000 in words is "forty-eight billion, four hundred sixty-six million, one hundred fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •