Base | Representation |
---|---|
bin | 1011101111110… |
… | …0000001000101 |
3 | 10102201000021201 |
4 | 2323330001011 |
5 | 100103014012 |
6 | 4515542501 |
7 | 1135521601 |
oct | 273740105 |
9 | 112630251 |
10 | 49266757 |
11 | 2589a931 |
12 | 145baa31 |
13 | a28c737 |
14 | 6786501 |
15 | 44d2857 |
hex | 2efc045 |
49266757 has 8 divisors (see below), whose sum is σ = 50037336. Its totient is φ = 48502272.
The previous prime is 49266739. The next prime is 49266761. The reversal of 49266757 is 75766294.
49266757 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 2563201 + 46703556 = 1601^2 + 6834^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-49266757 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 (49266727) 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, 16353 + ... + 19129.
It is an arithmetic number, because the mean of its divisors is an integer number (6254667).
Almost surely, 249266757 is an apocalyptic number.
It is an amenable number.
49266757 is a deficient number, since it is larger than the sum of its proper divisors (770579).
49266757 is a wasteful number, since it uses less digits than its factorization.
49266757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3047.
The product of its digits is 635040, while the sum is 46.
The square root of 49266757 is about 7019.0282090899. The cubic root of 49266757 is about 366.5934141086.
The spelling of 49266757 in words is "forty-nine million, two hundred sixty-six thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •