Base | Representation |
---|---|
bin | 101101001111101000… |
… | …001001011010101011 |
3 | 11122101122220101101021 |
4 | 231033220021122223 |
5 | 1243443111032101 |
6 | 34152334033311 |
7 | 3336604662163 |
oct | 551750113253 |
9 | 148348811337 |
10 | 48580564651 |
11 | 1966a50a293 |
12 | 94b9648837 |
13 | 4772977b58 |
14 | 24cbddd5a3 |
15 | 13e4e615a1 |
hex | b4fa096ab |
48580564651 has 8 divisors (see below), whose sum is σ = 49251179520. Its totient is φ = 47910088512.
The previous prime is 48580564633. The next prime is 48580564657. The reversal of 48580564651 is 15646508584.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 48580564651 - 221 = 48578467499 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48580564657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 812001 + ... + 869773.
It is an arithmetic number, because the mean of its divisors is an integer number (6156397440).
Almost surely, 248580564651 is an apocalyptic number.
48580564651 is a deficient number, since it is larger than the sum of its proper divisors (670614869).
48580564651 is a wasteful number, since it uses less digits than its factorization.
48580564651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69365.
The product of its (nonzero) digits is 4608000, while the sum is 52.
The spelling of 48580564651 in words is "forty-eight billion, five hundred eighty million, five hundred sixty-four thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •