Base | Representation |
---|---|
bin | 100000100001000… |
… | …0011000011111111 |
3 | 2211001000101021201 |
4 | 1001002003003333 |
5 | 4213302241441 |
6 | 300133040331 |
7 | 36015551623 |
oct | 10102030377 |
9 | 2731011251 |
10 | 1091055871 |
11 | 50a966474 |
12 | 2654860a7 |
13 | 14506b8b9 |
14 | a4c91183 |
15 | 65bbac31 |
hex | 410830ff |
1091055871 has 2 divisors, whose sum is σ = 1091055872. Its totient is φ = 1091055870.
The previous prime is 1091055863. The next prime is 1091055929. The reversal of 1091055871 is 1785501901.
It is a weak prime.
It is an emirp because it is prime and its reverse (1785501901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1091055871 - 23 = 1091055863 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1091055871.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1091055851) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 545527935 + 545527936.
It is an arithmetic number, because the mean of its divisors is an integer number (545527936).
Almost surely, 21091055871 is an apocalyptic number.
1091055871 is a deficient number, since it is larger than the sum of its proper divisors (1).
1091055871 is an equidigital number, since it uses as much as digits as its factorization.
1091055871 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 37.
The square root of 1091055871 is about 33031.1348730255. The cubic root of 1091055871 is about 1029.4746656545.
The spelling of 1091055871 in words is "one billion, ninety-one million, fifty-five thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •