Base | Representation |
---|---|
bin | 1011111001010… |
… | …0011010010001 |
3 | 10110212201112101 |
4 | 2332110122101 |
5 | 100233002321 |
6 | 4541200401 |
7 | 1144031461 |
oct | 276243221 |
9 | 113781471 |
10 | 49890961 |
11 | 261868aa |
12 | 14860101 |
13 | a44a8a3 |
14 | 68a9ba1 |
15 | 45a7791 |
hex | 2f94691 |
49890961 has 2 divisors, whose sum is σ = 49890962. Its totient is φ = 49890960.
The previous prime is 49890959. The next prime is 49890977. The reversal of 49890961 is 16909894.
49890961 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29811600 + 20079361 = 5460^2 + 4481^2 .
It is a cyclic number.
It is not a de Polignac number, because 49890961 - 21 = 49890959 is a prime.
Together with 49890959, it forms a pair of twin primes.
It is a Chen prime.
It is an alternating number because its digits alternate between even and odd.
It is not a weakly prime, because it can be changed into another prime (49890661) 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, 24945480 + 24945481.
It is an arithmetic number, because the mean of its divisors is an integer number (24945481).
Almost surely, 249890961 is an apocalyptic number.
It is an amenable number.
49890961 is a deficient number, since it is larger than the sum of its proper divisors (1).
49890961 is an equidigital number, since it uses as much as digits as its factorization.
49890961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 46.
The square root of 49890961 is about 7063.3533820700. The cubic root of 49890961 is about 368.1351528817.
The spelling of 49890961 in words is "forty-nine million, eight hundred ninety thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •