Base | Representation |
---|---|
bin | 11110100001110100001000… |
… | …001101111010011001011101 |
3 | 122121101121201101220000221112 |
4 | 132201310020031322121131 |
5 | 120044244421242130203 |
6 | 1153320312410111405 |
7 | 40165222413631133 |
oct | 3641641015723135 |
9 | 577347641800845 |
10 | 134265110505053 |
11 | 39865571661150 |
12 | 13085589a1b565 |
13 | 59bc1b7b39a48 |
14 | 2522674a9b753 |
15 | 107c824c0e6d8 |
hex | 7a1d0837a65d |
134265110505053 has 8 divisors (see below), whose sum is σ = 147921237857376. Its totient is φ = 120850684522000.
The previous prime is 134265110505013. The next prime is 134265110505091. The reversal of 134265110505053 is 350505011562431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 134265110505053 - 28 = 134265110504797 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 134265110505053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134265110505013) 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, 60425341151 + ... + 60425343372.
It is an arithmetic number, because the mean of its divisors is an integer number (18490154732172).
Almost surely, 2134265110505053 is an apocalyptic number.
It is an amenable number.
134265110505053 is a deficient number, since it is larger than the sum of its proper divisors (13656127352323).
134265110505053 is a wasteful number, since it uses less digits than its factorization.
134265110505053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120850684635.
The product of its (nonzero) digits is 270000, while the sum is 41.
The spelling of 134265110505053 in words is "one hundred thirty-four trillion, two hundred sixty-five billion, one hundred ten million, five hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •