Base | Representation |
---|---|
bin | 1011100000011… |
… | …1001001111001 |
3 | 10100211001111012 |
4 | 2320013021321 |
5 | 44323420201 |
6 | 4442243305 |
7 | 1124143535 |
oct | 270071171 |
9 | 110731435 |
10 | 48263801 |
11 | 25275343 |
12 | 141b6535 |
13 | 9ccb081 |
14 | 65a4bc5 |
15 | 43855bb |
hex | 2e07279 |
48263801 has 8 divisors (see below), whose sum is σ = 50015880. Its totient is φ = 46517632.
The previous prime is 48263797. The next prime is 48263837. The reversal of 48263801 is 10836284.
48263801 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 640000 + 47623801 = 800^2 + 6901^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 48263801 - 22 = 48263797 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (48263701) 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 in 7 ways as a sum of consecutive naturals, for example, 21341 + ... + 23493.
It is an arithmetic number, because the mean of its divisors is an integer number (6251985).
Almost surely, 248263801 is an apocalyptic number.
It is an amenable number.
48263801 is a deficient number, since it is larger than the sum of its proper divisors (1752079).
48263801 is a wasteful number, since it uses less digits than its factorization.
48263801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2955.
The product of its (nonzero) digits is 9216, while the sum is 32.
The square root of 48263801 is about 6947.2153414156. The cubic root of 48263801 is about 364.0886779275.
The spelling of 48263801 in words is "forty-eight million, two hundred sixty-three thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •