Base | Representation |
---|---|
bin | 11110100000000001111100… |
… | …001000001010111100000101 |
3 | 122120221220020112200012001222 |
4 | 132200001330020022330011 |
5 | 120040242320240333123 |
6 | 1153144114141130125 |
7 | 40153322141135453 |
oct | 3640017410127405 |
9 | 576856215605058 |
10 | 134142501105413 |
11 | 398185738714a9 |
12 | 13065870259945 |
13 | 59b077816b228 |
14 | 251a762d879d3 |
15 | 107954ab1d6c8 |
hex | 7a007c20af05 |
134142501105413 has 16 divisors (see below), whose sum is σ = 145120404000000. Its totient is φ = 123561182469312.
The previous prime is 134142501105367. The next prime is 134142501105421. The reversal of 134142501105413 is 314501105241431.
It is a cyclic number.
It is not a de Polignac number, because 134142501105413 - 28 = 134142501105157 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134142501105493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65760413 + ... + 67769586.
It is an arithmetic number, because the mean of its divisors is an integer number (9070025250000).
Almost surely, 2134142501105413 is an apocalyptic number.
It is an amenable number.
134142501105413 is a deficient number, since it is larger than the sum of its proper divisors (10977902894587).
134142501105413 is a wasteful number, since it uses less digits than its factorization.
134142501105413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133531484.
The product of its (nonzero) digits is 28800, while the sum is 35.
Adding to 134142501105413 its reverse (314501105241431), we get a palindrome (448643606346844).
The spelling of 134142501105413 in words is "one hundred thirty-four trillion, one hundred forty-two billion, five hundred one million, one hundred five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •