Base | Representation |
---|---|
bin | 1011100110001… |
… | …0101101010001 |
3 | 10101112002220002 |
4 | 2321202231101 |
5 | 44422420201 |
6 | 4454255345 |
7 | 1130265041 |
oct | 271425521 |
9 | 111462802 |
10 | 48638801 |
11 | 25501062 |
12 | 14357555 |
13 | a0cc973 |
14 | 6661721 |
15 | 440b76b |
hex | 2e62b51 |
48638801 has 2 divisors, whose sum is σ = 48638802. Its totient is φ = 48638800.
The previous prime is 48638791. The next prime is 48638839. The reversal of 48638801 is 10883684.
48638801 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (48638839) can be obtained adding 48638801 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 42562576 + 6076225 = 6524^2 + 2465^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-48638801 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (48658801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24319400 + 24319401.
It is an arithmetic number, because the mean of its divisors is an integer number (24319401).
Almost surely, 248638801 is an apocalyptic number.
It is an amenable number.
48638801 is a deficient number, since it is larger than the sum of its proper divisors (1).
48638801 is an equidigital number, since it uses as much as digits as its factorization.
48638801 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36864, while the sum is 38.
The square root of 48638801 is about 6974.1523499276. The cubic root of 48638801 is about 365.0292113983.
The spelling of 48638801 in words is "forty-eight million, six hundred thirty-eight thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •