Base | Representation |
---|---|
bin | 1011101010001… |
… | …1000101001101 |
3 | 10102000111120212 |
4 | 2322203011031 |
5 | 100004334402 |
6 | 4504052205 |
7 | 1132443551 |
oct | 272430515 |
9 | 112014525 |
10 | 48902477 |
11 | 25671178 |
12 | 14464065 |
13 | a1929a0 |
14 | 66cd861 |
15 | 445e952 |
hex | 2ea314d |
48902477 has 4 divisors (see below), whose sum is σ = 52664220. Its totient is φ = 45140736.
The previous prime is 48902471. The next prime is 48902479. The reversal of 48902477 is 77420984.
48902477 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 28526281 + 20376196 = 5341^2 + 4514^2 .
It is a cyclic number.
It is not a de Polignac number, because 48902477 - 216 = 48836941 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48902471) 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 3 ways as a sum of consecutive naturals, for example, 1880852 + ... + 1880877.
It is an arithmetic number, because the mean of its divisors is an integer number (13166055).
Almost surely, 248902477 is an apocalyptic number.
It is an amenable number.
48902477 is a deficient number, since it is larger than the sum of its proper divisors (3761743).
48902477 is a wasteful number, since it uses less digits than its factorization.
48902477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3761742.
The product of its (nonzero) digits is 112896, while the sum is 41.
The square root of 48902477 is about 6993.0306019636. The cubic root of 48902477 is about 365.6876434609.
The spelling of 48902477 in words is "forty-eight million, nine hundred two thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •