Base | Representation |
---|---|
bin | 1011101100011… |
… | …0110010000000 |
3 | 10102021221011200 |
4 | 2323012302000 |
5 | 100024024304 |
6 | 4511141200 |
7 | 1133623065 |
oct | 273066200 |
9 | 112257150 |
10 | 49048704 |
11 | 25761021 |
12 | 14514800 |
13 | a214403 |
14 | 672ac6c |
15 | 448ce39 |
hex | 2ec6c80 |
49048704 has 48 divisors (see below), whose sum is σ = 141146070. Its totient is φ = 16349184.
The previous prime is 49048687. The next prime is 49048721. The reversal of 49048704 is 40784094.
It is an interprime number because it is at equal distance from previous prime (49048687) and next prime (49048721).
It can be written as a sum of positive squares in only one way, i.e., 31809600 + 17239104 = 5640^2 + 4152^2 .
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 20137 + ... + 22440.
Almost surely, 249048704 is an apocalyptic number.
It is an amenable number.
49048704 is an abundant number, since it is smaller than the sum of its proper divisors (92097366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49048704 is a wasteful number, since it uses less digits than its factorization.
49048704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42597 (or 42582 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
The square root of 49048704 is about 7003.4779931117. The cubic root of 49048704 is about 366.0517708725.
It can be divided in two parts, 490 and 48704, that added together give a palindrome (49194).
The spelling of 49048704 in words is "forty-nine million, forty-eight thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •