Base | Representation |
---|---|
bin | 101110010000001101… |
… | …100001101001010111 |
3 | 11202012011202221101001 |
4 | 232100031201221113 |
5 | 1303203002330142 |
6 | 34452042044131 |
7 | 3405502633114 |
oct | 562015415127 |
9 | 152164687331 |
10 | 49664105047 |
11 | 1a076102217 |
12 | 97604a9647 |
13 | 48b62b4a0b |
14 | 2591c9590b |
15 | 145a1455b7 |
hex | b90361a57 |
49664105047 has 2 divisors, whose sum is σ = 49664105048. Its totient is φ = 49664105046.
The previous prime is 49664104981. The next prime is 49664105053. The reversal of 49664105047 is 74050146694.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-49664105047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 49664104988 and 49664105006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49664105147) 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, 24832052523 + 24832052524.
It is an arithmetic number, because the mean of its divisors is an integer number (24832052524).
Almost surely, 249664105047 is an apocalyptic number.
49664105047 is a deficient number, since it is larger than the sum of its proper divisors (1).
49664105047 is an equidigital number, since it uses as much as digits as its factorization.
49664105047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 725760, while the sum is 46.
The spelling of 49664105047 in words is "forty-nine billion, six hundred sixty-four million, one hundred five thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •