Base | Representation |
---|---|
bin | 101111011111110101… |
… | …1100111000010010011 |
3 | 100202021120020101020222 |
4 | 1132333223213002103 |
5 | 3132344013100042 |
6 | 114505212423255 |
7 | 10240441532621 |
oct | 1367753470223 |
9 | 322246211228 |
10 | 102000128147 |
11 | 3a29245aa75 |
12 | 17927777b2b |
13 | 9807000218 |
14 | 4d18950511 |
15 | 29beb252d2 |
hex | 17bfae7093 |
102000128147 has 2 divisors, whose sum is σ = 102000128148. Its totient is φ = 102000128146.
The previous prime is 102000128141. The next prime is 102000128149. The reversal of 102000128147 is 741821000201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102000128147 is a prime.
It is a super-2 number, since 2×1020001281472 (a number of 23 digits) contains 22 as substring.
Together with 102000128149, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (102000128141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000064073 + 51000064074.
It is an arithmetic number, because the mean of its divisors is an integer number (51000064074).
Almost surely, 2102000128147 is an apocalyptic number.
102000128147 is a deficient number, since it is larger than the sum of its proper divisors (1).
102000128147 is an equidigital number, since it uses as much as digits as its factorization.
102000128147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 896, while the sum is 26.
Adding to 102000128147 its reverse (741821000201), we get a palindrome (843821128348).
The spelling of 102000128147 in words is "one hundred two billion, one hundred twenty-eight thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.297 sec. • engine limits •