Base | Representation |
---|---|
bin | 111110100110011001… |
… | …1110100110000111101 |
3 | 110211222211201200122221 |
4 | 1331030303310300331 |
5 | 4200304223440221 |
6 | 141431342005341 |
7 | 12466236405136 |
oct | 1751463646075 |
9 | 424884650587 |
10 | 134432640061 |
11 | 520157a2225 |
12 | 22079276851 |
13 | c8a5325385 |
14 | 671407cc8d |
15 | 376c098541 |
hex | 1f4ccf4c3d |
134432640061 has 2 divisors, whose sum is σ = 134432640062. Its totient is φ = 134432640060.
The previous prime is 134432639987. The next prime is 134432640079. The reversal of 134432640061 is 160046234431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130686588036 + 3746052025 = 361506^2 + 61205^2 .
It is a cyclic number.
It is not a de Polignac number, because 134432640061 - 211 = 134432638013 is a prime.
It is a super-3 number, since 3×1344326400613 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 134432639999 and 134432640026.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (134432647061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67216320030 + 67216320031.
It is an arithmetic number, because the mean of its divisors is an integer number (67216320031).
Almost surely, 2134432640061 is an apocalyptic number.
It is an amenable number.
134432640061 is a deficient number, since it is larger than the sum of its proper divisors (1).
134432640061 is an equidigital number, since it uses as much as digits as its factorization.
134432640061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 41472, while the sum is 34.
Adding to 134432640061 its reverse (160046234431), we get a palindrome (294478874492).
The spelling of 134432640061 in words is "one hundred thirty-four billion, four hundred thirty-two million, six hundred forty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •