Base | Representation |
---|---|
bin | 1000001110100000101… |
… | …1101000011001001101 |
3 | 111111210211110012001022 |
4 | 2003220023220121031 |
5 | 4303423041112441 |
6 | 144532244523525 |
7 | 13132252604141 |
oct | 2035013503115 |
9 | 444724405038 |
10 | 141334316621 |
11 | 54a3759aa53 |
12 | 234846b05a5 |
13 | 10435153964 |
14 | 6baa923221 |
15 | 3a22e3e84b |
hex | 20e82e864d |
141334316621 has 8 divisors (see below), whose sum is σ = 141729042840. Its totient is φ = 140939675712.
The previous prime is 141334316527. The next prime is 141334316659. The reversal of 141334316621 is 126613433141.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 16915863721 + 124418452900 = 130061^2 + 352730^2 .
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 141334316621 - 210 = 141334315597 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141334316681) 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, 4794395 + ... + 4823783.
It is an arithmetic number, because the mean of its divisors is an integer number (17716130355).
Almost surely, 2141334316621 is an apocalyptic number.
It is an amenable number.
141334316621 is a deficient number, since it is larger than the sum of its proper divisors (394726219).
141334316621 is a wasteful number, since it uses less digits than its factorization.
141334316621 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42655.
The product of its digits is 31104, while the sum is 35.
Adding to 141334316621 its reverse (126613433141), we get a palindrome (267947749762).
The spelling of 141334316621 in words is "one hundred forty-one billion, three hundred thirty-four million, three hundred sixteen thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •