Base | Representation |
---|---|
bin | 11110011111111001011010… |
… | …010110001100110001100001 |
3 | 122120221000121101202112012122 |
4 | 132133321122112030301201 |
5 | 120040120042133014014 |
6 | 1153140001401434025 |
7 | 40152546213463421 |
oct | 3637713226146141 |
9 | 576830541675178 |
10 | 134133344423009 |
11 | 398146a5094488 |
12 | 13063b3579b915 |
13 | 59ac9490bc569 |
14 | 251a134c28481 |
15 | 10791b1ce258e |
hex | 79fe5a58cc61 |
134133344423009 has 2 divisors, whose sum is σ = 134133344423010. Its totient is φ = 134133344423008.
The previous prime is 134133344422999. The next prime is 134133344423041. The reversal of 134133344423009 is 900324443331431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111846022729984 + 22287321693025 = 10575728^2 + 4720945^2 .
It is a cyclic number.
It is not a de Polignac number, because 134133344423009 - 24 = 134133344422993 is a prime.
It is a super-3 number, since 3×1341333444230093 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (134133344422009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67066672211504 + 67066672211505.
It is an arithmetic number, because the mean of its divisors is an integer number (67066672211505).
Almost surely, 2134133344423009 is an apocalyptic number.
It is an amenable number.
134133344423009 is a deficient number, since it is larger than the sum of its proper divisors (1).
134133344423009 is an equidigital number, since it uses as much as digits as its factorization.
134133344423009 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1119744, while the sum is 44.
The spelling of 134133344423009 in words is "one hundred thirty-four trillion, one hundred thirty-three billion, three hundred forty-four million, four hundred twenty-three thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •