Base | Representation |
---|---|
bin | 101111100011101110… |
… | …0010100100110000101 |
3 | 100202121122020201211211 |
4 | 1133013130110212011 |
5 | 3133130331310211 |
6 | 114530143331421 |
7 | 10243612356664 |
oct | 1370734244605 |
9 | 322548221754 |
10 | 102130338181 |
11 | 3a349a05773 |
12 | 179632b0b71 |
13 | 9827c90491 |
14 | 4d2bd66ddb |
15 | 29cb295e21 |
hex | 17c7714985 |
102130338181 has 2 divisors, whose sum is σ = 102130338182. Its totient is φ = 102130338180.
The previous prime is 102130338173. The next prime is 102130338197. The reversal of 102130338181 is 181833031201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 60037250625 + 42093087556 = 245025^2 + 205166^2 .
It is a cyclic number.
It is not a de Polignac number, because 102130338181 - 23 = 102130338173 is a prime.
It is a super-2 number, since 2×1021303381812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102130338161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51065169090 + 51065169091.
It is an arithmetic number, because the mean of its divisors is an integer number (51065169091).
Almost surely, 2102130338181 is an apocalyptic number.
It is an amenable number.
102130338181 is a deficient number, since it is larger than the sum of its proper divisors (1).
102130338181 is an equidigital number, since it uses as much as digits as its factorization.
102130338181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 31.
Adding to 102130338181 its reverse (181833031201), we get a palindrome (283963369382).
The spelling of 102130338181 in words is "one hundred two billion, one hundred thirty million, three hundred thirty-eight thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •