Base | Representation |
---|---|
bin | 101100111010110001… |
… | …000100010100000000 |
3 | 11121111021100101202111 |
4 | 230322301010110000 |
5 | 1242234012102004 |
6 | 34053512425104 |
7 | 3325125115150 |
oct | 547261042400 |
9 | 147437311674 |
10 | 48230581504 |
11 | 194aa9a6816 |
12 | 94203a8194 |
13 | 47182c9531 |
14 | 2497738760 |
15 | 13c437ca04 |
hex | b3ac44500 |
48230581504 has 72 divisors (see below), whose sum is σ = 110134055808. Its totient is φ = 20649953280.
The previous prime is 48230581429. The next prime is 48230581513. The reversal of 48230581504 is 40518503284.
It is a hoax number, since the sum of its digits (40) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 1888629 + ... + 1913995.
It is an arithmetic number, because the mean of its divisors is an integer number (1529639664).
Almost surely, 248230581504 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 48230581504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55067027904).
48230581504 is an abundant number, since it is smaller than the sum of its proper divisors (61903474304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48230581504 is a wasteful number, since it uses less digits than its factorization.
48230581504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26451 (or 26437 counting only the distinct ones).
The product of its (nonzero) digits is 153600, while the sum is 40.
The spelling of 48230581504 in words is "forty-eight billion, two hundred thirty million, five hundred eighty-one thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •