Base | Representation |
---|---|
bin | 100000000101110010101001… |
… | …100111011001111111011101 |
3 | 200111201102022122022010122212 |
4 | 200011302221213121333131 |
5 | 121444330421040314031 |
6 | 1220100423523450205 |
7 | 41504462353541024 |
oct | 4005625147317735 |
9 | 614642278263585 |
10 | 141135471026141 |
11 | 40a74243000179 |
12 | 139b4bbb826965 |
13 | 609a03018b827 |
14 | 26bcdc96738bb |
15 | 114b3ce06112b |
hex | 805ca99d9fdd |
141135471026141 has 8 divisors (see below), whose sum is σ = 141416648271360. Its totient is φ = 140854296122512.
The previous prime is 141135471026131. The next prime is 141135471026159. The reversal of 141135471026141 is 141620174531141.
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 141135471026141 - 230 = 141134397284317 is a prime.
It is a super-3 number, since 3×1411354710261413 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141135471026101) 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, 168859220 + ... + 169692978.
It is an arithmetic number, because the mean of its divisors is an integer number (17677081033920).
Almost surely, 2141135471026141 is an apocalyptic number.
It is an amenable number.
141135471026141 is a deficient number, since it is larger than the sum of its proper divisors (281177245219).
141135471026141 is an equidigital number, since it uses as much as digits as its factorization.
141135471026141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1170795.
The product of its (nonzero) digits is 80640, while the sum is 41.
The spelling of 141135471026141 in words is "one hundred forty-one trillion, one hundred thirty-five billion, four hundred seventy-one million, twenty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •