Base | Representation |
---|---|
bin | 1011101100000… |
… | …1101000010111 |
3 | 10102020212020022 |
4 | 2323001220113 |
5 | 100022340412 |
6 | 4510455355 |
7 | 1133504426 |
oct | 273015027 |
9 | 112225208 |
10 | 49027607 |
11 | 25747192 |
12 | 1450455b |
13 | a207925 |
14 | 67232bd |
15 | 4486a72 |
hex | 2ec1a17 |
49027607 has 2 divisors, whose sum is σ = 49027608. Its totient is φ = 49027606.
The previous prime is 49027567. The next prime is 49027613. The reversal of 49027607 is 70672094.
49027607 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 49027607 - 28 = 49027351 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49027807) 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 as a sum of consecutive naturals, namely, 24513803 + 24513804.
It is an arithmetic number, because the mean of its divisors is an integer number (24513804).
Almost surely, 249027607 is an apocalyptic number.
49027607 is a deficient number, since it is larger than the sum of its proper divisors (1).
49027607 is an equidigital number, since it uses as much as digits as its factorization.
49027607 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21168, while the sum is 35.
The square root of 49027607 is about 7001.9716508995. The cubic root of 49027607 is about 365.9992808570. Note that the first 3 decimals are identical.
The spelling of 49027607 in words is "forty-nine million, twenty-seven thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •