Base | Representation |
---|---|
bin | 10110000111011110… |
… | …01000011100001101 |
3 | 1010122111201221001002 |
4 | 23003233020130031 |
5 | 143304201101203 |
6 | 5242121430045 |
7 | 600150014615 |
oct | 130357103415 |
9 | 33574657032 |
10 | 11873847053 |
11 | 5043528042 |
12 | 237463b325 |
13 | 1172c95103 |
14 | 808d7da45 |
15 | 497651d88 |
hex | 2c3bc870d |
11873847053 has 2 divisors, whose sum is σ = 11873847054. Its totient is φ = 11873847052.
The previous prime is 11873847001. The next prime is 11873847059. The reversal of 11873847053 is 35074837811.
11873847053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10306716484 + 1567130569 = 101522^2 + 39587^2 .
It is a cyclic number.
It is not a de Polignac number, because 11873847053 - 218 = 11873584909 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11873846989 and 11873847007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11873847059) 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, 5936923526 + 5936923527.
It is an arithmetic number, because the mean of its divisors is an integer number (5936923527).
Almost surely, 211873847053 is an apocalyptic number.
It is an amenable number.
11873847053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11873847053 is an equidigital number, since it uses as much as digits as its factorization.
11873847053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 564480, while the sum is 47.
The spelling of 11873847053 in words is "eleven billion, eight hundred seventy-three million, eight hundred forty-seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.651 sec. • engine limits •