Base | Representation |
---|---|
bin | 101101100011100010… |
… | …000000101110011011 |
3 | 11200020221021002020221 |
4 | 231203202000232123 |
5 | 1300134103004012 |
6 | 34245423300511 |
7 | 3351101252125 |
oct | 554342005633 |
9 | 150227232227 |
10 | 48914500507 |
11 | 19820a62234 |
12 | 959144a737 |
13 | 47c6bc8232 |
14 | 25204c8215 |
15 | 1414425507 |
hex | b63880b9b |
48914500507 has 2 divisors, whose sum is σ = 48914500508. Its totient is φ = 48914500506.
The previous prime is 48914500417. The next prime is 48914500513. The reversal of 48914500507 is 70500541984.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 48914500507 - 215 = 48914467739 is a prime.
It is not a weakly prime, because it can be changed into another prime (48914500207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24457250253 + 24457250254.
It is an arithmetic number, because the mean of its divisors is an integer number (24457250254).
Almost surely, 248914500507 is an apocalyptic number.
48914500507 is a deficient number, since it is larger than the sum of its proper divisors (1).
48914500507 is an equidigital number, since it uses as much as digits as its factorization.
48914500507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 201600, while the sum is 43.
The spelling of 48914500507 in words is "forty-eight billion, nine hundred fourteen million, five hundred thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •