Base | Representation |
---|---|
bin | 100000001111101011011111… |
… | …101011101111110100110101 |
3 | 200121010101020222220021022001 |
4 | 200033223133223233310311 |
5 | 122041444041114412311 |
6 | 1221340523114535301 |
7 | 41604536323664341 |
oct | 4017533753576465 |
9 | 617111228807261 |
10 | 141814982966581 |
11 | 4120643a859441 |
12 | 13aa483aa37531 |
13 | 6119131ab98b2 |
14 | 2703c4b928621 |
15 | 115ddee5e24c1 |
hex | 80fadfaefd35 |
141814982966581 has 8 divisors (see below), whose sum is σ = 141832013582240. Its totient is φ = 141797952877392.
The previous prime is 141814982966551. The next prime is 141814982966597. The reversal of 141814982966581 is 185669289418141.
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 141814982966581 - 231 = 141812835482933 is a prime.
It is a super-2 number, since 2×1418149829665812 (a number of 29 digits) contains 22 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 (141814982966551) 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, 856686286 + ... + 856851808.
It is an arithmetic number, because the mean of its divisors is an integer number (17729001697780).
Almost surely, 2141814982966581 is an apocalyptic number.
It is an amenable number.
141814982966581 is a deficient number, since it is larger than the sum of its proper divisors (17030615659).
141814982966581 is an equidigital number, since it uses as much as digits as its factorization.
141814982966581 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 263235.
The product of its digits is 238878720, while the sum is 73.
The spelling of 141814982966581 in words is "one hundred forty-one trillion, eight hundred fourteen billion, nine hundred eighty-two million, nine hundred sixty-six thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •