Base | Representation |
---|---|
bin | 1100001011001… |
… | …10110010010001 |
3 | 21010011212222022 |
4 | 12011212302101 |
5 | 202121223011 |
6 | 14045021225 |
7 | 2350054334 |
oct | 605466221 |
9 | 233155868 |
10 | 102132881 |
11 | 52718a44 |
12 | 2a254815 |
13 | 1820c576 |
14 | d7c861b |
15 | 8e768db |
hex | 6166c91 |
102132881 has 2 divisors, whose sum is σ = 102132882. Its totient is φ = 102132880.
The previous prime is 102132871. The next prime is 102132907. The reversal of 102132881 is 188231201.
It is an a-pointer prime, because the next prime (102132907) can be obtained adding 102132881 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91374481 + 10758400 = 9559^2 + 3280^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102132881 is a prime.
It is a super-2 number, since 2×1021328812 = 20862250762720322, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102132881.
It is not a weakly prime, because it can be changed into another prime (102132841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51066440 + 51066441.
It is an arithmetic number, because the mean of its divisors is an integer number (51066441).
Almost surely, 2102132881 is an apocalyptic number.
It is an amenable number.
102132881 is a deficient number, since it is larger than the sum of its proper divisors (1).
102132881 is an equidigital number, since it uses as much as digits as its factorization.
102132881 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 26.
The square root of 102132881 is about 10106.0813869670. The cubic root of 102132881 is about 467.4356814295.
The spelling of 102132881 in words is "one hundred two million, one hundred thirty-two thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •