Base | Representation |
---|---|
bin | 101101001110101000… |
… | …001011101000111011 |
3 | 11122100111100110212002 |
4 | 231032220023220323 |
5 | 1243424312442124 |
6 | 34150534411215 |
7 | 3336312313436 |
oct | 551650135073 |
9 | 148314313762 |
10 | 48563796539 |
11 | 19660aa7145 |
12 | 94b3b00b0b |
13 | 476c3567ab |
14 | 24c9ab681d |
15 | 13e374d0ae |
hex | b4ea0ba3b |
48563796539 has 4 divisors (see below), whose sum is σ = 48565781040. Its totient is φ = 48561812040.
The previous prime is 48563796497. The next prime is 48563796587. The reversal of 48563796539 is 93569736584.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-48563796539 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (48563796599) 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 3 ways as a sum of consecutive naturals, for example, 955079 + ... + 1004640.
It is an arithmetic number, because the mean of its divisors is an integer number (12141445260).
Almost surely, 248563796539 is an apocalyptic number.
48563796539 is a deficient number, since it is larger than the sum of its proper divisors (1984501).
48563796539 is a wasteful number, since it uses less digits than its factorization.
48563796539 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1984500.
The product of its digits is 146966400, while the sum is 65.
The spelling of 48563796539 in words is "forty-eight billion, five hundred sixty-three million, seven hundred ninety-six thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •