Base | Representation |
---|---|
bin | 101111011111110101… |
… | …1100010111000101111 |
3 | 100202021120012111221111 |
4 | 1132333223202320233 |
5 | 3132344012024101 |
6 | 114505212212451 |
7 | 10240441432231 |
oct | 1367753427057 |
9 | 322246174844 |
10 | 102000111151 |
11 | 3a292449224 |
12 | 1792776a127 |
13 | 9806cc5573 |
14 | 4d18948251 |
15 | 29beb20251 |
hex | 17bfae2e2f |
102000111151 has 2 divisors, whose sum is σ = 102000111152. Its totient is φ = 102000111150.
The previous prime is 102000111013. The next prime is 102000111211. The reversal of 102000111151 is 151111000201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102000111151 - 231 = 99852627503 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102000111751) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000055575 + 51000055576.
It is an arithmetic number, because the mean of its divisors is an integer number (51000055576).
Almost surely, 2102000111151 is an apocalyptic number.
102000111151 is a deficient number, since it is larger than the sum of its proper divisors (1).
102000111151 is an equidigital number, since it uses as much as digits as its factorization.
102000111151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 13.
Adding to 102000111151 its reverse (151111000201), we get a palindrome (253111111352).
The spelling of 102000111151 in words is "one hundred two billion, one hundred eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •