Base | Representation |
---|---|
bin | 1011111010111… |
… | …1000000000101 |
3 | 10111002020221022 |
4 | 2332233000011 |
5 | 100244444002 |
6 | 4543400525 |
7 | 1144664144 |
oct | 276570005 |
9 | 114066838 |
10 | 49999877 |
11 | 26250714 |
12 | 148b3145 |
13 | a488335 |
14 | 68d775b |
15 | 45c9ba2 |
hex | 2faf005 |
49999877 has 2 divisors, whose sum is σ = 49999878. Its totient is φ = 49999876.
The previous prime is 49999853. The next prime is 49999883. The reversal of 49999877 is 77899994.
49999877 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 can be written as a sum of positive squares in only one way, i.e., 40271716 + 9728161 = 6346^2 + 3119^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-49999877 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49999847) 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, 24999938 + 24999939.
It is an arithmetic number, because the mean of its divisors is an integer number (24999939).
Almost surely, 249999877 is an apocalyptic number.
It is an amenable number.
49999877 is a deficient number, since it is larger than the sum of its proper divisors (1).
49999877 is an equidigital number, since it uses as much as digits as its factorization.
49999877 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10287648, while the sum is 62.
The square root of 49999877 is about 7071.0591144467. The cubic root of 49999877 is about 368.4028477732.
It can be divided in two parts, 4999987 and 7, that added together give a palindrome (4999994).
The spelling of 49999877 in words is "forty-nine million, nine hundred ninety-nine thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •