Base | Representation |
---|---|
bin | 101110001001001110… |
… | …100000101101110101 |
3 | 11201220000021110122101 |
4 | 232021032200231311 |
5 | 1302433003012434 |
6 | 34432254302101 |
7 | 3402550616113 |
oct | 561116405565 |
9 | 151800243571 |
10 | 49546922869 |
11 | 1a015a45544 |
12 | 97291b7931 |
13 | 4897c36552 |
14 | 25804b0ab3 |
15 | 144ebe9b14 |
hex | b893a0b75 |
49546922869 has 2 divisors, whose sum is σ = 49546922870. Its totient is φ = 49546922868.
The previous prime is 49546922861. The next prime is 49546922879. The reversal of 49546922869 is 96822964594.
49546922869 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 38518772644 + 11028150225 = 196262^2 + 105015^2 .
It is a cyclic number.
It is not a de Polignac number, because 49546922869 - 23 = 49546922861 is a prime.
It is a super-2 number, since 2×495469228692 (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 49546922869.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49546922861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24773461434 + 24773461435.
It is an arithmetic number, because the mean of its divisors is an integer number (24773461435).
Almost surely, 249546922869 is an apocalyptic number.
It is an amenable number.
49546922869 is a deficient number, since it is larger than the sum of its proper divisors (1).
49546922869 is an equidigital number, since it uses as much as digits as its factorization.
49546922869 is an evil number, because the sum of its binary digits is even.
The product of its digits is 67184640, while the sum is 64.
The spelling of 49546922869 in words is "forty-nine billion, five hundred forty-six million, nine hundred twenty-two thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •