Base | Representation |
---|---|
bin | 111100110100000000… |
… | …1010000000000100001 |
3 | 110111002022222120022111 |
4 | 1321220001100000201 |
5 | 4114424102131212 |
6 | 135554422235321 |
7 | 12302150121661 |
oct | 1715001200041 |
9 | 414068876274 |
10 | 130594177057 |
11 | 50426010153 |
12 | 21387885b41 |
13 | c413011ba6 |
14 | 646c3781a1 |
15 | 35e50d0ea7 |
hex | 1e68050021 |
130594177057 has 2 divisors, whose sum is σ = 130594177058. Its totient is φ = 130594177056.
The previous prime is 130594177037. The next prime is 130594177067. The reversal of 130594177057 is 750771495031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76502581281 + 54091595776 = 276591^2 + 232576^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130594177057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130594177057.
It is not a weakly prime, because it can be changed into another prime (130594177027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65297088528 + 65297088529.
It is an arithmetic number, because the mean of its divisors is an integer number (65297088529).
Almost surely, 2130594177057 is an apocalyptic number.
It is an amenable number.
130594177057 is a deficient number, since it is larger than the sum of its proper divisors (1).
130594177057 is an equidigital number, since it uses as much as digits as its factorization.
130594177057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 926100, while the sum is 49.
The spelling of 130594177057 in words is "one hundred thirty billion, five hundred ninety-four million, one hundred seventy-seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •