Base | Representation |
---|---|
bin | 101101101101011101… |
… | …100111110101010011 |
3 | 11200200112210100011012 |
4 | 231231131213311103 |
5 | 1301004231402011 |
6 | 34314134441135 |
7 | 3355163440346 |
oct | 555535476523 |
9 | 150615710135 |
10 | 49081122131 |
11 | 198a7017558 |
12 | 96192031ab |
13 | 4822596902 |
14 | 253869c45d |
15 | 1423d89a8b |
hex | b6d767d53 |
49081122131 has 2 divisors, whose sum is σ = 49081122132. Its totient is φ = 49081122130.
The previous prime is 49081122121. The next prime is 49081122137. The reversal of 49081122131 is 13122118094.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 49081122131 - 230 = 48007380307 is a prime.
It is a super-2 number, since 2×490811221312 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (49081122137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24540561065 + 24540561066.
It is an arithmetic number, because the mean of its divisors is an integer number (24540561066).
Almost surely, 249081122131 is an apocalyptic number.
49081122131 is a deficient number, since it is larger than the sum of its proper divisors (1).
49081122131 is an equidigital number, since it uses as much as digits as its factorization.
49081122131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 32.
The spelling of 49081122131 in words is "forty-nine billion, eighty-one million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •