Base | Representation |
---|---|
bin | 111110110011000001… |
… | …1010100000001001101 |
3 | 110220002100121020112002 |
4 | 1331212003110001031 |
5 | 4202141132140022 |
6 | 141541350522045 |
7 | 12512601124424 |
oct | 1754603240115 |
9 | 426070536462 |
10 | 134856130637 |
11 | 52212851a38 |
12 | 22177066325 |
13 | c941c9cb07 |
14 | 67543da2bb |
15 | 379434c092 |
hex | 1f660d404d |
134856130637 has 2 divisors, whose sum is σ = 134856130638. Its totient is φ = 134856130636.
The previous prime is 134856130613. The next prime is 134856130711. The reversal of 134856130637 is 736031658431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75706972201 + 59149158436 = 275149^2 + 243206^2 .
It is a cyclic number.
It is not a de Polignac number, because 134856130637 - 26 = 134856130573 is a prime.
It is a super-2 number, since 2×1348561306372 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 134856130591 and 134856130600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134856130037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67428065318 + 67428065319.
It is an arithmetic number, because the mean of its divisors is an integer number (67428065319).
Almost surely, 2134856130637 is an apocalyptic number.
It is an amenable number.
134856130637 is a deficient number, since it is larger than the sum of its proper divisors (1).
134856130637 is an equidigital number, since it uses as much as digits as its factorization.
134856130637 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1088640, while the sum is 47.
The spelling of 134856130637 in words is "one hundred thirty-four billion, eight hundred fifty-six million, one hundred thirty thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •