Base | Representation |
---|---|
bin | 101101110001100011… |
… | …100100110011110111 |
3 | 11200212100000002210101 |
4 | 231301203210303313 |
5 | 1301124321311404 |
6 | 34325030334531 |
7 | 3356656222465 |
oct | 556143446367 |
9 | 150770002711 |
10 | 49149791479 |
11 | 19931859888 |
12 | 96381ba447 |
13 | 483388a869 |
14 | 2543855835 |
15 | 1429e012a4 |
hex | b718e4cf7 |
49149791479 has 2 divisors, whose sum is σ = 49149791480. Its totient is φ = 49149791478.
The previous prime is 49149791447. The next prime is 49149791497. The reversal of 49149791479 is 97419794194.
Together with next prime (49149791497) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 49149791479 - 25 = 49149791447 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 49149791479.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49149794479) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24574895739 + 24574895740.
It is an arithmetic number, because the mean of its divisors is an integer number (24574895740).
Almost surely, 249149791479 is an apocalyptic number.
49149791479 is a deficient number, since it is larger than the sum of its proper divisors (1).
49149791479 is an equidigital number, since it uses as much as digits as its factorization.
49149791479 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20575296, while the sum is 64.
The spelling of 49149791479 in words is "forty-nine billion, one hundred forty-nine million, seven hundred ninety-one thousand, four hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •