Base | Representation |
---|---|
bin | 11110100010011110111110… |
… | …001111011001010100011110 |
3 | 122121120000110110121201220010 |
4 | 132202132332033121110132 |
5 | 120101023130142121001 |
6 | 1153353401325104050 |
7 | 40201441420230261 |
oct | 3642367617312436 |
9 | 577500413551803 |
10 | 134311114020126 |
11 | 3988302942099a |
12 | 130924883b8026 |
13 | 59c3639918c94 |
14 | 252499a710cd8 |
15 | 107db187c58d6 |
hex | 7a27be3d951e |
134311114020126 has 16 divisors (see below), whose sum is σ = 268626423605904. Its totient is φ = 44769672079104.
The previous prime is 134311114020071. The next prime is 134311114020143. The reversal of 134311114020126 is 621020411113431.
It is a happy number.
It is a super-2 number, since 2×1343111140201262 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 134311114020093 and 134311114020102.
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, 174398995 + ... + 175167438.
It is an arithmetic number, because the mean of its divisors is an integer number (16789151475369).
Almost surely, 2134311114020126 is an apocalyptic number.
134311114020126 is an abundant number, since it is smaller than the sum of its proper divisors (134315309585778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134311114020126 is a wasteful number, since it uses less digits than its factorization.
134311114020126 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 349630475.
The product of its (nonzero) digits is 3456, while the sum is 30.
Adding to 134311114020126 its reverse (621020411113431), we get a palindrome (755331525133557).
The spelling of 134311114020126 in words is "one hundred thirty-four trillion, three hundred eleven billion, one hundred fourteen million, twenty thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •