Base | Representation |
---|---|
bin | 11110100010011111110100… |
… | …100001000000001110100001 |
3 | 122121120002210221001021100002 |
4 | 132202133310201000032201 |
5 | 120101032011244334401 |
6 | 1153354031534105345 |
7 | 40201503115124363 |
oct | 3642376441001641 |
9 | 577502727037302 |
10 | 134312024605601 |
11 | 39883456423277 |
12 | 130926a134b255 |
13 | 59c375347a85b |
14 | 2524a45624d33 |
15 | 107db6d6e3a6b |
hex | 7a27f48403a1 |
134312024605601 has 8 divisors (see below), whose sum is σ = 140515330362624. Its totient is φ = 128248118978080.
The previous prime is 134312024605559. The next prime is 134312024605643. The reversal of 134312024605601 is 106506420213431.
It is an interprime number because it is at equal distance from previous prime (134312024605559) and next prime (134312024605643).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-134312024605601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134312024605691) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34850030405 + ... + 34850034258.
It is an arithmetic number, because the mean of its divisors is an integer number (17564416295328).
Almost surely, 2134312024605601 is an apocalyptic number.
It is an amenable number.
134312024605601 is a deficient number, since it is larger than the sum of its proper divisors (6203305757023).
134312024605601 is an equidigital number, since it uses as much as digits as its factorization.
134312024605601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69700064751.
The product of its (nonzero) digits is 103680, while the sum is 38.
The spelling of 134312024605601 in words is "one hundred thirty-four trillion, three hundred twelve billion, twenty-four million, six hundred five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •