Base | Representation |
---|---|
bin | 11110100010110100010101… |
… | …111011110000111101000101 |
3 | 122121122012200121201122120111 |
4 | 132202310111323300331011 |
5 | 120101412123341334131 |
6 | 1153412114255233021 |
7 | 40203213144566422 |
oct | 3642642573607505 |
9 | 577565617648514 |
10 | 134334060105541 |
11 | 3989183393654a |
12 | 13096a10b18771 |
13 | 59c585577c00a |
14 | 2525b35da6d49 |
15 | 107e50ced5ab1 |
hex | 7a2d15ef0f45 |
134334060105541 has 8 divisors (see below), whose sum is σ = 136597277401344. Its totient is φ = 132081153595440.
The previous prime is 134334060105473. The next prime is 134334060105559. The reversal of 134334060105541 is 145501060433431.
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 134334060105541 - 29 = 134334060105029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134334060105494 and 134334060105503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134334060105571) 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, 2577670150 + ... + 2577722263.
It is an arithmetic number, because the mean of its divisors is an integer number (17074659675168).
Almost surely, 2134334060105541 is an apocalyptic number.
It is an amenable number.
134334060105541 is a deficient number, since it is larger than the sum of its proper divisors (2263217295803).
134334060105541 is an equidigital number, since it uses as much as digits as its factorization.
134334060105541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5155392851.
The product of its (nonzero) digits is 259200, while the sum is 40.
The spelling of 134334060105541 in words is "one hundred thirty-four trillion, three hundred thirty-four billion, sixty million, one hundred five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •