Base | Representation |
---|---|
bin | 101110011110001110… |
… | …101000011000001111 |
3 | 11202210120021211222121 |
4 | 232132032220120033 |
5 | 1304143203311131 |
6 | 34531242353411 |
7 | 3414356563111 |
oct | 563616503017 |
9 | 152716254877 |
10 | 49899275791 |
11 | 1a186927502 |
12 | 98071bb867 |
13 | 4922c346c1 |
14 | 25b51d13b1 |
15 | 1470aea911 |
hex | b9e3a860f |
49899275791 has 2 divisors, whose sum is σ = 49899275792. Its totient is φ = 49899275790.
The previous prime is 49899275759. The next prime is 49899275819. The reversal of 49899275791 is 19757299894.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 49899275791 - 25 = 49899275759 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 49899275791.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49899278791) 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, 24949637895 + 24949637896.
It is an arithmetic number, because the mean of its divisors is an integer number (24949637896).
Almost surely, 249899275791 is an apocalyptic number.
49899275791 is a deficient number, since it is larger than the sum of its proper divisors (1).
49899275791 is an equidigital number, since it uses as much as digits as its factorization.
49899275791 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 102876480, while the sum is 70.
The spelling of 49899275791 in words is "forty-nine billion, eight hundred ninety-nine million, two hundred seventy-five thousand, seven hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •