Base | Representation |
---|---|
bin | 111110011100111110… |
… | …0101000000001011001 |
3 | 110211011210020212011001 |
4 | 1330321330220001121 |
5 | 4144132220230212 |
6 | 141340115105001 |
7 | 12455344502206 |
oct | 1747174500131 |
9 | 424153225131 |
10 | 134116180057 |
11 | 519730a6132 |
12 | 21bab2a2161 |
13 | c8548b3532 |
14 | 66c4022cad |
15 | 374e3d7657 |
hex | 1f39f28059 |
134116180057 has 2 divisors, whose sum is σ = 134116180058. Its totient is φ = 134116180056.
The previous prime is 134116180043. The next prime is 134116180087. The reversal of 134116180057 is 750081611431.
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., 100786565961 + 33329614096 = 317469^2 + 182564^2 .
It is a cyclic number.
It is not a de Polignac number, because 134116180057 - 223 = 134107791449 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 134116179998 and 134116180025.
It is not a weakly prime, because it can be changed into another prime (134116180087) 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, 67058090028 + 67058090029.
It is an arithmetic number, because the mean of its divisors is an integer number (67058090029).
Almost surely, 2134116180057 is an apocalyptic number.
It is an amenable number.
134116180057 is a deficient number, since it is larger than the sum of its proper divisors (1).
134116180057 is an equidigital number, since it uses as much as digits as its factorization.
134116180057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 37.
Adding to 134116180057 its reverse (750081611431), we get a palindrome (884197791488).
The spelling of 134116180057 in words is "one hundred thirty-four billion, one hundred sixteen million, one hundred eighty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •