Base | Representation |
---|---|
bin | 100000001001001010011101… |
… | …111001110101000110000101 |
3 | 200112112120110102110002002210 |
4 | 200021022131321311012011 |
5 | 122012130012401410031 |
6 | 1220355110231054033 |
7 | 41530305033030555 |
oct | 4011123571650605 |
9 | 615476412402083 |
10 | 141367202763141 |
11 | 41053548585003 |
12 | 13a31ab2211319 |
13 | 60b5b40581b34 |
14 | 26ca2cdb87165 |
15 | 1152443181746 |
hex | 80929de75185 |
141367202763141 has 8 divisors (see below), whose sum is σ = 188690766552064. Its totient is φ = 94144220408160.
The previous prime is 141367202763113. The next prime is 141367202763167.
141367202763141 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 141367202763141 - 245 = 106182830674309 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 (141367202763041) 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, 25145355205 + ... + 25145360826.
It is an arithmetic number, because the mean of its divisors is an integer number (23586345819008).
Almost surely, 2141367202763141 is an apocalyptic number.
It is an amenable number.
141367202763141 is a deficient number, since it is larger than the sum of its proper divisors (47323563788923).
141367202763141 is an equidigital number, since it uses as much as digits as its factorization.
141367202763141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50290716971.
The product of its (nonzero) digits is 1016064, while the sum is 48.
It can be divided in two parts, 14136720 and 2763141, that added together give a palindrome (16899861).
The spelling of 141367202763141 in words is "one hundred forty-one trillion, three hundred sixty-seven billion, two hundred two million, seven hundred sixty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •