Base | Representation |
---|---|
bin | 1010111100011000111… |
… | …1001011100101111101 |
3 | 122222021200222020202122 |
4 | 2233012033023211331 |
5 | 11040020410242031 |
6 | 222211555132325 |
7 | 16404023026454 |
oct | 2570617134575 |
9 | 588250866678 |
10 | 188009462141 |
11 | 72809492686 |
12 | 3052bba40a5 |
13 | 1496311b467 |
14 | 9157847b9b |
15 | 4d5597247b |
hex | 2bc63cb97d |
188009462141 has 2 divisors, whose sum is σ = 188009462142. Its totient is φ = 188009462140.
The previous prime is 188009462099. The next prime is 188009462167. The reversal of 188009462141 is 141264900881.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106001685241 + 82007776900 = 325579^2 + 286370^2 .
It is a cyclic number.
It is not a de Polignac number, because 188009462141 - 210 = 188009461117 is a prime.
It is a super-2 number, since 2×1880094621412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 188009462092 and 188009462101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (188009462171) 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, 94004731070 + 94004731071.
It is an arithmetic number, because the mean of its divisors is an integer number (94004731071).
Almost surely, 2188009462141 is an apocalyptic number.
It is an amenable number.
188009462141 is a deficient number, since it is larger than the sum of its proper divisors (1).
188009462141 is an equidigital number, since it uses as much as digits as its factorization.
188009462141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 110592, while the sum is 44.
The spelling of 188009462141 in words is "one hundred eighty-eight billion, nine million, four hundred sixty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •