Base | Representation |
---|---|
bin | 1011110101111… |
… | …0101100001111 |
3 | 10110110112200222 |
4 | 2331132230033 |
5 | 100203432202 |
6 | 4532341555 |
7 | 1142124125 |
oct | 275365417 |
9 | 113415628 |
10 | 49670927 |
11 | 26046559 |
12 | 147748bb |
13 | a3a16a7 |
14 | 684d915 |
15 | 45624a2 |
hex | 2f5eb0f |
49670927 has 4 divisors (see below), whose sum is σ = 49701960. Its totient is φ = 49639896.
The previous prime is 49670917. The next prime is 49670941. The reversal of 49670927 is 72907694.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 72907694 = 2 ⋅36453847.
It is a cyclic number.
It is not a de Polignac number, because 49670927 - 28 = 49670671 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49670917) 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, 12977 + ... + 16362.
It is an arithmetic number, because the mean of its divisors is an integer number (12425490).
Almost surely, 249670927 is an apocalyptic number.
49670927 is a deficient number, since it is larger than the sum of its proper divisors (31033).
49670927 is a wasteful number, since it uses less digits than its factorization.
49670927 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31032.
The product of its (nonzero) digits is 190512, while the sum is 44.
The square root of 49670927 is about 7047.7604244185. The cubic root of 49670927 is about 367.5931600865.
The spelling of 49670927 in words is "forty-nine million, six hundred seventy thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •