Base | Representation |
---|---|
bin | 111110110101111010… |
… | …0100000110111101101 |
3 | 110220100002201100220101 |
4 | 1331223310200313231 |
5 | 4202340421230123 |
6 | 141555125151101 |
7 | 12515154563032 |
oct | 1755364406755 |
9 | 426302640811 |
10 | 134952914413 |
11 | 52262447029 |
12 | 221a355b491 |
13 | c959058715 |
14 | 67631d1389 |
15 | 379cab8aad |
hex | 1f6bd20ded |
134952914413 has 2 divisors, whose sum is σ = 134952914414. Its totient is φ = 134952914412.
The previous prime is 134952914333. The next prime is 134952914429. The reversal of 134952914413 is 314419259431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82393683849 + 52559230564 = 287043^2 + 229258^2 .
It is an emirp because it is prime and its reverse (314419259431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134952914413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134952914813) 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, 67476457206 + 67476457207.
It is an arithmetic number, because the mean of its divisors is an integer number (67476457207).
Almost surely, 2134952914413 is an apocalyptic number.
It is an amenable number.
134952914413 is a deficient number, since it is larger than the sum of its proper divisors (1).
134952914413 is an equidigital number, since it uses as much as digits as its factorization.
134952914413 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 466560, while the sum is 46.
The spelling of 134952914413 in words is "one hundred thirty-four billion, nine hundred fifty-two million, nine hundred fourteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •