Base | Representation |
---|---|
bin | 10101110101111000010001… |
… | …00011000010001000100000 |
3 | 20022001200210102201002202220 |
4 | 22322330020203002020200 |
5 | 22243414000221011142 |
6 | 250053005555111040 |
7 | 13055052034341303 |
oct | 1272741043021040 |
9 | 208050712632686 |
10 | 48030762672672 |
11 | 1433880640762a |
12 | 54788252a2480 |
13 | 20a5387567700 |
14 | bc09b65b2b3a |
15 | 5845cc70d2ec |
hex | 2baf088c2220 |
48030762672672 has 576 divisors, whose sum is σ = 139815573448320. Its totient is φ = 14427267858432.
The previous prime is 48030762672593. The next prime is 48030762672721. The reversal of 48030762672672 is 27627626703084.
It is a happy number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 80996226808 + ... + 80996227400.
It is an arithmetic number, because the mean of its divisors is an integer number (242735370570).
Almost surely, 248030762672672 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 48030762672672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69907786724160).
48030762672672 is an abundant number, since it is smaller than the sum of its proper divisors (91784810775648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48030762672672 is a wasteful number, since it uses less digits than its factorization.
48030762672672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1245 (or 1224 counting only the distinct ones).
The product of its (nonzero) digits is 56899584, while the sum is 60.
The spelling of 48030762672672 in words is "forty-eight trillion, thirty billion, seven hundred sixty-two million, six hundred seventy-two thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •