Base | Representation |
---|---|
bin | 111110101011110110… |
… | …0101011001011100101 |
3 | 110212110120110112210211 |
4 | 1331113230223023211 |
5 | 4201143010041143 |
6 | 141501425215421 |
7 | 12503615204503 |
oct | 1752754531345 |
9 | 425416415724 |
10 | 134615315173 |
11 | 520a9921799 |
12 | 2210a491571 |
13 | c904124a61 |
14 | 6730431673 |
15 | 377d12e49d |
hex | 1f57b2b2e5 |
134615315173 has 2 divisors, whose sum is σ = 134615315174. Its totient is φ = 134615315172.
The previous prime is 134615315057. The next prime is 134615315251. The reversal of 134615315173 is 371513516431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92186318884 + 42428996289 = 303622^2 + 205983^2 .
It is an emirp because it is prime and its reverse (371513516431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 134615315173 - 221 = 134613218021 is a prime.
It is a super-2 number, since 2×1346153151732 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134615315573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67307657586 + 67307657587.
It is an arithmetic number, because the mean of its divisors is an integer number (67307657587).
Almost surely, 2134615315173 is an apocalyptic number.
It is an amenable number.
134615315173 is a deficient number, since it is larger than the sum of its proper divisors (1).
134615315173 is an equidigital number, since it uses as much as digits as its factorization.
134615315173 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 113400, while the sum is 40.
The spelling of 134615315173 in words is "one hundred thirty-four billion, six hundred fifteen million, three hundred fifteen thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •