Base | Representation |
---|---|
bin | 1011101111110… |
… | …1000010111101 |
3 | 10102201020001212 |
4 | 2323331002331 |
5 | 100103132343 |
6 | 4520014205 |
7 | 1135540103 |
oct | 273750275 |
9 | 112636055 |
10 | 49270973 |
11 | 258a3014 |
12 | 14601365 |
13 | a29162b |
14 | 6787c73 |
15 | 44d3c18 |
hex | 2efd0bd |
49270973 has 4 divisors (see below), whose sum is σ = 50200668. Its totient is φ = 48341280.
The previous prime is 49270967. The next prime is 49270987. The reversal of 49270973 is 37907294.
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 33605209 + 15665764 = 5797^2 + 3958^2 .
It is a cyclic number.
It is not a de Polignac number, because 49270973 - 210 = 49269949 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 49270973.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49270073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 464768 + ... + 464873.
It is an arithmetic number, because the mean of its divisors is an integer number (12550167).
Almost surely, 249270973 is an apocalyptic number.
It is an amenable number.
49270973 is a deficient number, since it is larger than the sum of its proper divisors (929695).
49270973 is an equidigital number, since it uses as much as digits as its factorization.
49270973 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 929694.
The product of its (nonzero) digits is 95256, while the sum is 41.
The square root of 49270973 is about 7019.3285291401. The cubic root of 49270973 is about 366.6038708807.
The spelling of 49270973 in words is "forty-nine million, two hundred seventy thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •