Base | Representation |
---|---|
bin | 101101001010001000… |
… | …111000111010011101 |
3 | 11122011020122020011122 |
4 | 231022020320322131 |
5 | 1243301023001014 |
6 | 34135244300325 |
7 | 3334406214023 |
oct | 551210707235 |
9 | 148136566148 |
10 | 48488484509 |
11 | 196225380a3 |
12 | 94928416a5 |
13 | 475987816a |
14 | 24bdab0713 |
15 | 13dbd2358e |
hex | b4a238e9d |
48488484509 has 2 divisors, whose sum is σ = 48488484510. Its totient is φ = 48488484508.
The previous prime is 48488484469. The next prime is 48488484511. The reversal of 48488484509 is 90548488484.
48488484509 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30472939225 + 18015545284 = 174565^2 + 134222^2 .
It is a cyclic number.
It is not a de Polignac number, because 48488484509 - 220 = 48487435933 is a prime.
It is a super-2 number, since 2×484884845092 (a number of 22 digits) contains 22 as substring.
Together with 48488484511, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (48488484559) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24244242254 + 24244242255.
It is an arithmetic number, because the mean of its divisors is an integer number (24244242255).
Almost surely, 248488484509 is an apocalyptic number.
It is an amenable number.
48488484509 is a deficient number, since it is larger than the sum of its proper divisors (1).
48488484509 is an equidigital number, since it uses as much as digits as its factorization.
48488484509 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 47185920, while the sum is 62.
The spelling of 48488484509 in words is "forty-eight billion, four hundred eighty-eight million, four hundred eighty-four thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •