Base | Representation |
---|---|
bin | 101101101011110101… |
… | …101000100111110111 |
3 | 11200121122111101211012 |
4 | 231223311220213313 |
5 | 1300430242044031 |
6 | 34311322302435 |
7 | 3354412644032 |
oct | 555365504767 |
9 | 150548441735 |
10 | 49053862391 |
11 | 19892698946 |
12 | 9610057a1b |
13 | 4819a40ca1 |
14 | 2534c04019 |
15 | 14217a2b2b |
hex | b6bd689f7 |
49053862391 has 2 divisors, whose sum is σ = 49053862392. Its totient is φ = 49053862390.
The previous prime is 49053862357. The next prime is 49053862433. The reversal of 49053862391 is 19326835094.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 49053862391 - 26 = 49053862327 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49053462391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24526931195 + 24526931196.
It is an arithmetic number, because the mean of its divisors is an integer number (24526931196).
Almost surely, 249053862391 is an apocalyptic number.
49053862391 is a deficient number, since it is larger than the sum of its proper divisors (1).
49053862391 is an equidigital number, since it uses as much as digits as its factorization.
49053862391 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1399680, while the sum is 50.
The spelling of 49053862391 in words is "forty-nine billion, fifty-three million, eight hundred sixty-two thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •