Base | Representation |
---|---|
bin | 101101001101000111… |
… | …001000011001101111 |
3 | 11122021201110221001101 |
4 | 231031013020121233 |
5 | 1243401304332221 |
6 | 34144225223531 |
7 | 3335553132655 |
oct | 551507103157 |
9 | 148251427041 |
10 | 48538355311 |
11 | 196486aa836 |
12 | 94a7491ba7 |
13 | 4766cb9804 |
14 | 24c6572dd5 |
15 | 13e13c4d91 |
hex | b4d1c866f |
48538355311 has 2 divisors, whose sum is σ = 48538355312. Its totient is φ = 48538355310.
The previous prime is 48538355287. The next prime is 48538355357. The reversal of 48538355311 is 11355383584.
It is an a-pointer prime, because the next prime (48538355357) can be obtained adding 48538355311 to its sum of digits (46).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 48538355311 - 215 = 48538322543 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48538355611) 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, 24269177655 + 24269177656.
It is an arithmetic number, because the mean of its divisors is an integer number (24269177656).
Almost surely, 248538355311 is an apocalyptic number.
48538355311 is a deficient number, since it is larger than the sum of its proper divisors (1).
48538355311 is an equidigital number, since it uses as much as digits as its factorization.
48538355311 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 864000, while the sum is 46.
The spelling of 48538355311 in words is "forty-eight billion, five hundred thirty-eight million, three hundred fifty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •