Base | Representation |
---|---|
bin | 100000000110111001010010… |
… | …000010011100111010110101 |
3 | 200111222200002001211201011002 |
4 | 200012321102002130322311 |
5 | 122002101231122213331 |
6 | 1220155325240253045 |
7 | 41513115634031252 |
oct | 4006712202347265 |
9 | 614880061751132 |
10 | 141211311132341 |
11 | 40aa342084349a |
12 | 13a07846471185 |
13 | 60a422851a908 |
14 | 26c2941b56429 |
15 | 114d36c2239cb |
hex | 806e5209ceb5 |
141211311132341 has 16 divisors (see below), whose sum is σ = 144896907879360. Its totient is φ = 137537234286720.
The previous prime is 141211311132329. The next prime is 141211311132343. The reversal of 141211311132341 is 143231113112141.
It is not a de Polignac number, because 141211311132341 - 214 = 141211311115957 is a prime.
It is a super-2 number, since 2×1412113111323412 (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 (141211311132343) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 510411050 + ... + 510687636.
It is an arithmetic number, because the mean of its divisors is an integer number (9056056742460).
Almost surely, 2141211311132341 is an apocalyptic number.
It is an amenable number.
141211311132341 is a deficient number, since it is larger than the sum of its proper divisors (3685596747019).
141211311132341 is a wasteful number, since it uses less digits than its factorization.
141211311132341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297364.
The product of its digits is 1728, while the sum is 29.
Adding to 141211311132341 its reverse (143231113112141), we get a palindrome (284442424244482).
The spelling of 141211311132341 in words is "one hundred forty-one trillion, two hundred eleven billion, three hundred eleven million, one hundred thirty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •