Base | Representation |
---|---|
bin | 10110000101100001000000… |
… | …10100010111100101100011 |
3 | 20100222001120200110210200201 |
4 | 23002300200110113211203 |
5 | 22331214312243043241 |
6 | 251143502425530031 |
7 | 13141632055535245 |
oct | 1302604024274543 |
9 | 210861520423621 |
10 | 48568032393571 |
11 | 14525650135a59 |
12 | 5544987943917 |
13 | 2113c3ac0c272 |
14 | bdc9c352c095 |
15 | 5935752b1931 |
hex | 2c2c20517963 |
48568032393571 has 2 divisors, whose sum is σ = 48568032393572. Its totient is φ = 48568032393570.
The previous prime is 48568032393553. The next prime is 48568032393599. The reversal of 48568032393571 is 17539323086584.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 48568032393571 - 217 = 48568032262499 is a prime.
It is not a weakly prime, because it can be changed into another prime (48568032390571) 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 as a sum of consecutive naturals, namely, 24284016196785 + 24284016196786.
It is an arithmetic number, because the mean of its divisors is an integer number (24284016196786).
It is a 1-persistent number, because it is pandigital, but 2⋅48568032393571 = 97136064787142 is not.
Almost surely, 248568032393571 is an apocalyptic number.
48568032393571 is a deficient number, since it is larger than the sum of its proper divisors (1).
48568032393571 is an equidigital number, since it uses as much as digits as its factorization.
48568032393571 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 130636800, while the sum is 64.
The spelling of 48568032393571 in words is "forty-eight trillion, five hundred sixty-eight billion, thirty-two million, three hundred ninety-three thousand, five hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •