Base | Representation |
---|---|
bin | 11110100001011101000010… |
… | …001100111100000011100011 |
3 | 122121022020201020222220101120 |
4 | 132201131002030330003203 |
5 | 120043343130230240301 |
6 | 1153301052040503323 |
7 | 40163354053031061 |
oct | 3641350214740343 |
9 | 577266636886346 |
10 | 134240313524451 |
11 | 39855aa738a652 |
12 | 1308080947ab43 |
13 | 59b9a656a6c64 |
14 | 25213a1681031 |
15 | 107bd72c90e36 |
hex | 7a174233c0e3 |
134240313524451 has 8 divisors (see below), whose sum is σ = 178989569090640. Its totient is φ = 89492300153952.
The previous prime is 134240313524431. The next prime is 134240313524461. The reversal of 134240313524451 is 154425313042431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 134240313524451 - 213 = 134240313516259 is a prime.
It is a super-2 number, since 2×1342403135244512 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (134240313524431) 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, 310296736 + ... + 310729053.
It is an arithmetic number, because the mean of its divisors is an integer number (22373696136330).
Almost surely, 2134240313524451 is an apocalyptic number.
134240313524451 is a deficient number, since it is larger than the sum of its proper divisors (44749255566189).
134240313524451 is an equidigital number, since it uses as much as digits as its factorization.
134240313524451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 621097845.
The product of its (nonzero) digits is 691200, while the sum is 42.
Adding to 134240313524451 its reverse (154425313042431), we get a palindrome (288665626566882).
The spelling of 134240313524451 in words is "one hundred thirty-four trillion, two hundred forty billion, three hundred thirteen million, five hundred twenty-four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •