Base | Representation |
---|---|
bin | 101101101101000010… |
… | …101100010100110001 |
3 | 11200200001111200100121 |
4 | 231231002230110301 |
5 | 1301000430001031 |
6 | 34313323250241 |
7 | 3355046435632 |
oct | 555502542461 |
9 | 150601450317 |
10 | 49074062641 |
11 | 198a303566a |
12 | 9616979981 |
13 | 4820c945b6 |
14 | 2537781889 |
15 | 1423443011 |
hex | b6d0ac531 |
49074062641 has 2 divisors, whose sum is σ = 49074062642. Its totient is φ = 49074062640.
The previous prime is 49074062623. The next prime is 49074062689. The reversal of 49074062641 is 14626047094.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28585003041 + 20489059600 = 169071^2 + 143140^2 .
It is a cyclic number.
It is not a de Polignac number, because 49074062641 - 227 = 48939844913 is a prime.
It is not a weakly prime, because it can be changed into another prime (49074062621) 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, 24537031320 + 24537031321.
It is an arithmetic number, because the mean of its divisors is an integer number (24537031321).
Almost surely, 249074062641 is an apocalyptic number.
It is an amenable number.
49074062641 is a deficient number, since it is larger than the sum of its proper divisors (1).
49074062641 is an equidigital number, since it uses as much as digits as its factorization.
49074062641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 290304, while the sum is 43.
The spelling of 49074062641 in words is "forty-nine billion, seventy-four million, sixty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •