Base | Representation |
---|---|
bin | 101101011010110101… |
… | …001001010100000000 |
3 | 11122212202120120200000 |
4 | 231122311021110000 |
5 | 1244334220141342 |
6 | 34223130400000 |
7 | 3344346410226 |
oct | 553265112400 |
9 | 148782516600 |
10 | 48768521472 |
11 | 19756617000 |
12 | 9550590000 |
13 | 47a28a65c8 |
14 | 2508d68b16 |
15 | 14066dc44c |
hex | b5ad49500 |
48768521472 has 864 divisors, whose sum is σ = 174278307840. Its totient is φ = 13548902400.
The previous prime is 48768521471. The next prime is 48768521479. The reversal of 48768521472 is 27412586784.
48768521472 is a `hidden beast` number, since 4 + 8 + 76 + 8 + 521 + 47 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (864).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48768521471) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1573178097 + ... + 1573178127.
Almost surely, 248768521472 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 48768521472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87139153920).
48768521472 is an abundant number, since it is smaller than the sum of its proper divisors (125509786368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48768521472 is an equidigital number, since it uses as much as digits as its factorization.
48768521472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114 (or 66 counting only the distinct ones).
The product of its digits is 6021120, while the sum is 54.
The spelling of 48768521472 in words is "forty-eight billion, seven hundred sixty-eight million, five hundred twenty-one thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •