Base | Representation |
---|---|
bin | 100000000101110111010000… |
… | …110010100010101100101111 |
3 | 200111201220002202201212011111 |
4 | 200011313100302202230233 |
5 | 121444421041321132421 |
6 | 1220103003150332451 |
7 | 41505026155534003 |
oct | 4005672062425457 |
9 | 614656082655144 |
10 | 141140423224111 |
11 | 40a76354428873 |
12 | 139b5b621ba127 |
13 | 609a63c15159c |
14 | 26bd339250703 |
15 | 114b5bdbc3ee1 |
hex | 805dd0ca2b2f |
141140423224111 has 8 divisors (see below), whose sum is σ = 146007484272000. Its totient is φ = 136273372169760.
The previous prime is 141140423224081. The next prime is 141140423224123. The reversal of 141140423224111 is 111422324041141.
It is a happy number.
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 141140423224111 - 215 = 141140423191343 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141140423224181) 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, 36612465 + ... + 40283413.
It is an arithmetic number, because the mean of its divisors is an integer number (18250935534000).
Almost surely, 2141140423224111 is an apocalyptic number.
141140423224111 is a deficient number, since it is larger than the sum of its proper divisors (4867061047889).
141140423224111 is a wasteful number, since it uses less digits than its factorization.
141140423224111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4996769.
The product of its (nonzero) digits is 6144, while the sum is 31.
Adding to 141140423224111 its reverse (111422324041141), we get a palindrome (252562747265252).
The spelling of 141140423224111 in words is "one hundred forty-one trillion, one hundred forty billion, four hundred twenty-three million, two hundred twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •