Base | Representation |
---|---|
bin | 101110010000100000… |
… | …010000000111000111 |
3 | 11202012112000100010121 |
4 | 232100200100013013 |
5 | 1303210231421314 |
6 | 34452335202411 |
7 | 3405562436605 |
oct | 562040200707 |
9 | 152175010117 |
10 | 49669013959 |
11 | 1a078955374 |
12 | 9762076407 |
13 | 48b73131b6 |
14 | 25927b2875 |
15 | 145a7b4d24 |
hex | b908101c7 |
49669013959 has 2 divisors, whose sum is σ = 49669013960. Its totient is φ = 49669013958.
The previous prime is 49669013941. The next prime is 49669014023. The reversal of 49669013959 is 95931096694.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 49669013959 - 213 = 49669005767 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 49669013897 and 49669013906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49669013909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24834506979 + 24834506980.
It is an arithmetic number, because the mean of its divisors is an integer number (24834506980).
Almost surely, 249669013959 is an apocalyptic number.
49669013959 is a deficient number, since it is larger than the sum of its proper divisors (1).
49669013959 is an equidigital number, since it uses as much as digits as its factorization.
49669013959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14171760, while the sum is 61.
The spelling of 49669013959 in words is "forty-nine billion, six hundred sixty-nine million, thirteen thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •