Base | Representation |
---|---|
bin | 101110001111001011… |
… | …110001110111011101 |
3 | 11202010222100022022021 |
4 | 232033023301313131 |
5 | 1303134044314411 |
6 | 34450224420141 |
7 | 3405203301112 |
oct | 561713616735 |
9 | 152128308267 |
10 | 49646869981 |
11 | 1a067400265 |
12 | 9756777651 |
13 | 48b285bc57 |
14 | 258d88a909 |
15 | 145888da71 |
hex | b8f2f1ddd |
49646869981 has 2 divisors, whose sum is σ = 49646869982. Its totient is φ = 49646869980.
The previous prime is 49646869963. The next prime is 49646870017. The reversal of 49646869981 is 18996864694.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 24861405625 + 24785464356 = 157675^2 + 157434^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-49646869981 is a prime.
It is a super-2 number, since 2×496468699812 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 49646869981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49646861981) 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, 24823434990 + 24823434991.
It is an arithmetic number, because the mean of its divisors is an integer number (24823434991).
Almost surely, 249646869981 is an apocalyptic number.
It is an amenable number.
49646869981 is a deficient number, since it is larger than the sum of its proper divisors (1).
49646869981 is an equidigital number, since it uses as much as digits as its factorization.
49646869981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 161243136, while the sum is 70.
The spelling of 49646869981 in words is "forty-nine billion, six hundred forty-six million, eight hundred sixty-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •