Base | Representation |
---|---|
bin | 111110100001110000… |
… | …1101110101110100001 |
3 | 110211120222200100220221 |
4 | 1331003201232232201 |
5 | 4144444341324133 |
6 | 141404100003041 |
7 | 12462335555536 |
oct | 1750341565641 |
9 | 424528610827 |
10 | 134276901793 |
11 | 51a458a0811 |
12 | 22035090481 |
13 | c87bc97658 |
14 | 66db4dcd8d |
15 | 375d583a2d |
hex | 1f4386eba1 |
134276901793 has 2 divisors, whose sum is σ = 134276901794. Its totient is φ = 134276901792.
The previous prime is 134276901767. The next prime is 134276901833. The reversal of 134276901793 is 397109672431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110083276944 + 24193624849 = 331788^2 + 155543^2 .
It is an emirp because it is prime and its reverse (397109672431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134276901793 is a prime.
It is a super-2 number, since 2×1342769017932 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 134276901793.
It is not a weakly prime, because it can be changed into another prime (134276901763) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67138450896 + 67138450897.
It is an arithmetic number, because the mean of its divisors is an integer number (67138450897).
Almost surely, 2134276901793 is an apocalyptic number.
It is an amenable number.
134276901793 is a deficient number, since it is larger than the sum of its proper divisors (1).
134276901793 is an equidigital number, since it uses as much as digits as its factorization.
134276901793 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1714608, while the sum is 52.
The spelling of 134276901793 in words is "one hundred thirty-four billion, two hundred seventy-six million, nine hundred one thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •