Base | Representation |
---|---|
bin | 101101101100011100… |
… | …010101100000111011 |
3 | 11200122100120211121211 |
4 | 231230130111200323 |
5 | 1300440341221424 |
6 | 34312323543551 |
7 | 3354565120225 |
oct | 555434254073 |
9 | 150570524554 |
10 | 49064007739 |
11 | 1989839822a |
12 | 961352abb7 |
13 | 481bb83a56 |
14 | 25362c5415 |
15 | 1422608b94 |
hex | b6c71583b |
49064007739 has 2 divisors, whose sum is σ = 49064007740. Its totient is φ = 49064007738.
The previous prime is 49064007703. The next prime is 49064007763. The reversal of 49064007739 is 93770046094.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 49064007739 - 219 = 49063483451 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 49064007692 and 49064007701.
It is not a weakly prime, because it can be changed into another prime (49064007539) 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 as a sum of consecutive naturals, namely, 24532003869 + 24532003870.
It is an arithmetic number, because the mean of its divisors is an integer number (24532003870).
Almost surely, 249064007739 is an apocalyptic number.
49064007739 is a deficient number, since it is larger than the sum of its proper divisors (1).
49064007739 is an equidigital number, since it uses as much as digits as its factorization.
49064007739 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1143072, while the sum is 49.
The spelling of 49064007739 in words is "forty-nine billion, sixty-four million, seven thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •