Base | Representation |
---|---|
bin | 11110100010101101011011… |
… | …101010110010000010010111 |
3 | 122121121111112111201112111101 |
4 | 132202231123222302002113 |
5 | 120101301424332432210 |
6 | 1153404450115250531 |
7 | 40202531236024351 |
oct | 3642553352620227 |
9 | 577544474645441 |
10 | 134326640124055 |
11 | 39889676509645 |
12 | 1309549bba9a47 |
13 | 59c4c42459922 |
14 | 25256307640d1 |
15 | 107e2268aca3a |
hex | 7a2b5bab2097 |
134326640124055 has 8 divisors (see below), whose sum is σ = 161330568300432. Its totient is φ = 107368911998208.
The previous prime is 134326640124041. The next prime is 134326640124073. The reversal of 134326640124055 is 550421046623431.
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 134326640124055 - 27 = 134326640123927 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134326640123996 and 134326640124014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11550006234 + ... + 11550017863.
It is an arithmetic number, because the mean of its divisors is an integer number (20166321037554).
Almost surely, 2134326640124055 is an apocalyptic number.
134326640124055 is a deficient number, since it is larger than the sum of its proper divisors (27003928176377).
134326640124055 is a wasteful number, since it uses less digits than its factorization.
134326640124055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23100025265.
The product of its (nonzero) digits is 2073600, while the sum is 46.
Adding to 134326640124055 its reverse (550421046623431), we get a palindrome (684747686747486).
The spelling of 134326640124055 in words is "one hundred thirty-four trillion, three hundred twenty-six billion, six hundred forty million, one hundred twenty-four thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •