Base | Representation |
---|---|
bin | 101101100100101010… |
… | …111001001001000000 |
3 | 11200022021012202000000 |
4 | 231210222321021000 |
5 | 1300204000342302 |
6 | 34251345000000 |
7 | 3351422534130 |
oct | 554452711100 |
9 | 150267182000 |
10 | 48933605952 |
11 | 19830821460 |
12 | 9597923000 |
13 | 47cab5742a |
14 | 2522c5cac0 |
15 | 1415e4b31c |
hex | b64ab9240 |
48933605952 has 784 divisors, whose sum is σ = 185655825792. Its totient is φ = 12421693440.
The previous prime is 48933605951. The next prime is 48933605957. The reversal of 48933605952 is 25950633984.
48933605952 is a `hidden beast` number, since 48 + 9 + 3 + 3 + 6 + 0 + 595 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (48933605951) by changing a digit.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 190403008 + ... + 190403264.
Almost surely, 248933605952 is an apocalyptic number.
48933605952 is a gapful number since it is divisible by the number (42) 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 48933605952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (92827912896).
48933605952 is an abundant number, since it is smaller than the sum of its proper divisors (136722219840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48933605952 is a wasteful number, since it uses less digits than its factorization.
48933605952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 358 (or 333 counting only the distinct ones).
The product of its (nonzero) digits is 6998400, while the sum is 54.
The spelling of 48933605952 in words is "forty-eight billion, nine hundred thirty-three million, six hundred five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •