Base | Representation |
---|---|
bin | 1100011000001100101111011… |
… | …1001110110011011011011011 |
3 | 11020020001212010001120120021222 |
4 | 3012003023313032303123123 |
5 | 1403131442222441311121 |
6 | 12324310343010322255 |
7 | 351316664365542131 |
oct | 30603136716633333 |
9 | 4206055101516258 |
10 | 871032105416411 |
11 | 2325a07068248a4 |
12 | 81837a3588938b |
13 | 2b503c8a399443 |
14 | 11514270a65751 |
15 | 6aa7825d7a0ab |
hex | 31832f73b36db |
871032105416411 has 2 divisors, whose sum is σ = 871032105416412. Its totient is φ = 871032105416410.
The previous prime is 871032105416359. The next prime is 871032105416443. The reversal of 871032105416411 is 114614501230178.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 871032105416411 - 246 = 800663361238747 is a prime.
It is a super-2 number, since 2×8710321054164112 (a number of 31 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (871032105412411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 435516052708205 + 435516052708206.
It is an arithmetic number, because the mean of its divisors is an integer number (435516052708206).
Almost surely, 2871032105416411 is an apocalyptic number.
871032105416411 is a deficient number, since it is larger than the sum of its proper divisors (1).
871032105416411 is an equidigital number, since it uses as much as digits as its factorization.
871032105416411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 161280, while the sum is 44.
Adding to 871032105416411 its reverse (114614501230178), we get a palindrome (985646606646589).
The spelling of 871032105416411 in words is "eight hundred seventy-one trillion, thirty-two billion, one hundred five million, four hundred sixteen thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •