Base | Representation |
---|---|
bin | 101110000111010010… |
… | …000101101001000111 |
3 | 11201210201220100212121 |
4 | 232013102011221013 |
5 | 1302401130243434 |
6 | 34425131230411 |
7 | 3402003441415 |
oct | 560722055107 |
9 | 151721810777 |
10 | 49514306119 |
11 | 19aa9598053 |
12 | 971a2a8407 |
13 | 48912564b5 |
14 | 257a0202b5 |
15 | 144be057b4 |
hex | b87485a47 |
49514306119 has 2 divisors, whose sum is σ = 49514306120. Its totient is φ = 49514306118.
The previous prime is 49514306077. The next prime is 49514306159. The reversal of 49514306119 is 91160341594.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 49514306119 - 27 = 49514305991 is a prime.
It is a super-2 number, since 2×495143061192 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49514306159) 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 as a sum of consecutive naturals, namely, 24757153059 + 24757153060.
It is an arithmetic number, because the mean of its divisors is an integer number (24757153060).
Almost surely, 249514306119 is an apocalyptic number.
49514306119 is a deficient number, since it is larger than the sum of its proper divisors (1).
49514306119 is an equidigital number, since it uses as much as digits as its factorization.
49514306119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 43.
The spelling of 49514306119 in words is "forty-nine billion, five hundred fourteen million, three hundred six thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •