Base | Representation |
---|---|
bin | 111110101101000011… |
… | …1101101010111110111 |
3 | 110212120101221100012002 |
4 | 1331122013231113313 |
5 | 4201233411101341 |
6 | 141505440245515 |
7 | 12504620513321 |
oct | 1753207552767 |
9 | 425511840162 |
10 | 134655956471 |
11 | 5211a860143 |
12 | 2212001089b |
13 | c90c68446a |
14 | 67359b0611 |
15 | 37819ab29b |
hex | 1f5a1ed5f7 |
134655956471 has 2 divisors, whose sum is σ = 134655956472. Its totient is φ = 134655956470.
The previous prime is 134655956459. The next prime is 134655956483. The reversal of 134655956471 is 174659556431.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (134655956459) and next prime (134655956483).
It is an emirp because it is prime and its reverse (174659556431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134655956471 is a prime.
It is a super-3 number, since 3×1346559564713 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134655956431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67327978235 + 67327978236.
It is an arithmetic number, because the mean of its divisors is an integer number (67327978236).
Almost surely, 2134655956471 is an apocalyptic number.
134655956471 is a deficient number, since it is larger than the sum of its proper divisors (1).
134655956471 is an equidigital number, since it uses as much as digits as its factorization.
134655956471 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13608000, while the sum is 56.
The spelling of 134655956471 in words is "one hundred thirty-four billion, six hundred fifty-five million, nine hundred fifty-six thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •