Base | Representation |
---|---|
bin | 1011101100110… |
… | …0001010001101 |
3 | 10102100001101120 |
4 | 2323030022031 |
5 | 100030230413 |
6 | 4511431153 |
7 | 1134044235 |
oct | 273141215 |
9 | 112301346 |
10 | 49070733 |
11 | 25776628 |
12 | 145254b9 |
13 | a22144a |
14 | 6734cc5 |
15 | 4494723 |
hex | 2ecc28d |
49070733 has 16 divisors (see below), whose sum is σ = 66745536. Its totient is φ = 32060160.
The previous prime is 49070731. The next prime is 49070743. The reversal of 49070733 is 33707094.
49070733 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 49070733 - 21 = 49070731 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 49070694 and 49070703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49070731) 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 15 ways as a sum of consecutive naturals, for example, 47935 + ... + 48947.
It is an arithmetic number, because the mean of its divisors is an integer number (4171596).
Almost surely, 249070733 is an apocalyptic number.
It is an amenable number.
49070733 is a deficient number, since it is larger than the sum of its proper divisors (17674803).
49070733 is a wasteful number, since it uses less digits than its factorization.
49070733 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1324.
The product of its (nonzero) digits is 15876, while the sum is 33.
The square root of 49070733 is about 7005.0505351496. The cubic root of 49070733 is about 366.1065636729.
The spelling of 49070733 in words is "forty-nine million, seventy thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •