Base | Representation |
---|---|
bin | 101110000111010010… |
… | …000101101000111111 |
3 | 11201210201220100212022 |
4 | 232013102011220333 |
5 | 1302401130243421 |
6 | 34425131230355 |
7 | 3402003441404 |
oct | 560722055077 |
9 | 151721810768 |
10 | 49514306111 |
11 | 19aa9598046 |
12 | 971a2a83bb |
13 | 48912564aa |
14 | 257a0202ab |
15 | 144be057ab |
hex | b87485a3f |
49514306111 has 4 divisors (see below), whose sum is σ = 51111541824. Its totient is φ = 47917070400.
The previous prime is 49514306077. The next prime is 49514306119. The reversal of 49514306111 is 11160341594.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 49514306111 - 26 = 49514306047 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49514306119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 798617810 + ... + 798617871.
It is an arithmetic number, because the mean of its divisors is an integer number (12777885456).
Almost surely, 249514306111 is an apocalyptic number.
49514306111 is a deficient number, since it is larger than the sum of its proper divisors (1597235713).
49514306111 is a wasteful number, since it uses less digits than its factorization.
49514306111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1597235712.
The product of its (nonzero) digits is 12960, while the sum is 35.
The spelling of 49514306111 in words is "forty-nine billion, five hundred fourteen million, three hundred six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •