Base | Representation |
---|---|
bin | 10100011100101010… |
… | …01010011111001001 |
3 | 1001100001202102100212 |
4 | 22032111022133021 |
5 | 134440312102431 |
6 | 5013153210505 |
7 | 536020106354 |
oct | 121625123711 |
9 | 31301672325 |
10 | 10977847241 |
11 | 4723788129 |
12 | 2164560a35 |
13 | 105c46c3ca |
14 | 761d8529b |
15 | 443b6572b |
hex | 28e54a7c9 |
10977847241 has 2 divisors, whose sum is σ = 10977847242. Its totient is φ = 10977847240.
The previous prime is 10977847207. The next prime is 10977847259. The reversal of 10977847241 is 14274877901.
10977847241 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., 7018920841 + 3958926400 = 83779^2 + 62920^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10977847241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10977847241.
It is not a weakly prime, because it can be changed into another prime (10977847271) 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, 5488923620 + 5488923621.
It is an arithmetic number, because the mean of its divisors is an integer number (5488923621).
Almost surely, 210977847241 is an apocalyptic number.
It is an amenable number.
10977847241 is a deficient number, since it is larger than the sum of its proper divisors (1).
10977847241 is an equidigital number, since it uses as much as digits as its factorization.
10977847241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 790272, while the sum is 50.
The spelling of 10977847241 in words is "ten billion, nine hundred seventy-seven million, eight hundred forty-seven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •