Base | Representation |
---|---|
bin | 101101000001101101111… |
… | …0101001010101101101001 |
3 | 210220121110002121221110122 |
4 | 1122003123311022231221 |
5 | 1302342411402212212 |
6 | 21054533000453025 |
7 | 1206046224021263 |
oct | 132033365125551 |
9 | 23817402557418 |
10 | 6188441054057 |
11 | 1a76559708469 |
12 | 83b44047a175 |
13 | 35b74ba01292 |
14 | 175744aa2b33 |
15 | aae9775e272 |
hex | 5a0dbd4ab69 |
6188441054057 has 2 divisors, whose sum is σ = 6188441054058. Its totient is φ = 6188441054056.
The previous prime is 6188441054011. The next prime is 6188441054177. The reversal of 6188441054057 is 7504501448816.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3198986222041 + 2989454832016 = 1788571^2 + 1729004^2 .
It is a cyclic number.
It is not a de Polignac number, because 6188441054057 - 228 = 6188172618601 is a prime.
It is a super-2 number, since 2×61884410540572 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (6188441054557) 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, 3094220527028 + 3094220527029.
It is an arithmetic number, because the mean of its divisors is an integer number (3094220527029).
Almost surely, 26188441054057 is an apocalyptic number.
It is an amenable number.
6188441054057 is a deficient number, since it is larger than the sum of its proper divisors (1).
6188441054057 is an equidigital number, since it uses as much as digits as its factorization.
6188441054057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4300800, while the sum is 53.
The spelling of 6188441054057 in words is "six trillion, one hundred eighty-eight billion, four hundred forty-one million, fifty-four thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •