Base | Representation |
---|---|
bin | 11110100011110101100001… |
… | …101010100110011100001101 |
3 | 122121212220100100100100122002 |
4 | 132203311201222212130031 |
5 | 120104033443314314211 |
6 | 1153504211313002045 |
7 | 40211241441266546 |
oct | 3643654152463415 |
9 | 577786310310562 |
10 | 134404050151181 |
11 | 3990948a449778 |
12 | 130a84a4553325 |
13 | 59cc32ab1c7c5 |
14 | 252929554b4cd |
15 | 10812577cc03b |
hex | 7a3d61aa670d |
134404050151181 has 2 divisors, whose sum is σ = 134404050151182. Its totient is φ = 134404050151180.
The previous prime is 134404050151079. The next prime is 134404050151247. The reversal of 134404050151181 is 181151050404431.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108457852776100 + 25946197375081 = 10414310^2 + 5093741^2 .
It is a cyclic number.
It is not a de Polignac number, because 134404050151181 - 230 = 134402976409357 is a prime.
It is a super-2 number, since 2×1344040501511812 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134404050651181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67202025075590 + 67202025075591.
It is an arithmetic number, because the mean of its divisors is an integer number (67202025075591).
Almost surely, 2134404050151181 is an apocalyptic number.
It is an amenable number.
134404050151181 is a deficient number, since it is larger than the sum of its proper divisors (1).
134404050151181 is an equidigital number, since it uses as much as digits as its factorization.
134404050151181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38400, while the sum is 38.
The spelling of 134404050151181 in words is "one hundred thirty-four trillion, four hundred four billion, fifty million, one hundred fifty-one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •