Base | Representation |
---|---|
bin | 11110100000000000111101… |
… | …101101111100111101100111 |
3 | 122120221210112120110000020211 |
4 | 132200000331231330331213 |
5 | 120040233144213420111 |
6 | 1153143422215040251 |
7 | 40153254165232336 |
oct | 3640007555747547 |
9 | 576853476400224 |
10 | 134141454045031 |
11 | 39818086825544 |
12 | 13065619670087 |
13 | 59b063c264984 |
14 | 251a6a3ca9d1d |
15 | 10794d8c43521 |
hex | 7a003db7cf67 |
134141454045031 has 8 divisors (see below), whose sum is σ = 134823236605200. Its totient is φ = 133459680187008.
The previous prime is 134141454044989. The next prime is 134141454045101. The reversal of 134141454045031 is 130540454141431.
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 134141454045031 - 217 = 134141453913959 is a prime.
It is a super-3 number, since 3×1341414540450313 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134141454045331) 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, 29933520 + ... + 34121818.
It is an arithmetic number, because the mean of its divisors is an integer number (16852904575650).
Almost surely, 2134141454045031 is an apocalyptic number.
134141454045031 is a deficient number, since it is larger than the sum of its proper divisors (681782560169).
134141454045031 is a wasteful number, since it uses less digits than its factorization.
134141454045031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4351073.
The product of its (nonzero) digits is 230400, while the sum is 40.
The spelling of 134141454045031 in words is "one hundred thirty-four trillion, one hundred forty-one billion, four hundred fifty-four million, forty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •