Base | Representation |
---|---|
bin | 101110000000010000… |
… | …110010110000111101 |
3 | 11201111112021112010012 |
4 | 232000100302300331 |
5 | 1302131002314031 |
6 | 34405322553005 |
7 | 3366043354514 |
oct | 560020626075 |
9 | 151445245105 |
10 | 49396526141 |
11 | 19a49062226 |
12 | 96a6968765 |
13 | 4872a28bc1 |
14 | 256852167b |
15 | 14418dcb2b |
hex | b80432c3d |
49396526141 has 2 divisors, whose sum is σ = 49396526142. Its totient is φ = 49396526140.
The previous prime is 49396526111. The next prime is 49396526147. The reversal of 49396526141 is 14162569394.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46548062500 + 2848463641 = 215750^2 + 53371^2 .
It is a cyclic number.
It is not a de Polignac number, because 49396526141 - 218 = 49396263997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 49396526141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49396526147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24698263070 + 24698263071.
It is an arithmetic number, because the mean of its divisors is an integer number (24698263071).
Almost surely, 249396526141 is an apocalyptic number.
It is an amenable number.
49396526141 is a deficient number, since it is larger than the sum of its proper divisors (1).
49396526141 is an equidigital number, since it uses as much as digits as its factorization.
49396526141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1399680, while the sum is 50.
The spelling of 49396526141 in words is "forty-nine billion, three hundred ninety-six million, five hundred twenty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •