Base | Representation |
---|---|
bin | 100000000100100110001001… |
… | …101100111010011011110101 |
3 | 200111102120022011202122202111 |
4 | 200010212021230322123311 |
5 | 121442004210243021323 |
6 | 1215555001130411021 |
7 | 41465524016653126 |
oct | 4004461154723365 |
9 | 614376264678674 |
10 | 141053331220213 |
11 | 40a42422248245 |
12 | 139a10b7290a71 |
13 | 609236c93c779 |
14 | 26b903664a04d |
15 | 11491c2cb5c0d |
hex | 804989b3a6f5 |
141053331220213 has 8 divisors (see below), whose sum is σ = 141479975819360. Its totient is φ = 140626689643440.
The previous prime is 141053331220189. The next prime is 141053331220223. The reversal of 141053331220213 is 312022133350141.
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 141053331220213 - 25 = 141053331220181 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 (141053331220223) 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, 123642931 + ... + 124778527.
It is an arithmetic number, because the mean of its divisors is an integer number (17684996977420).
Almost surely, 2141053331220213 is an apocalyptic number.
It is an amenable number.
141053331220213 is a deficient number, since it is larger than the sum of its proper divisors (426644599147).
141053331220213 is a wasteful number, since it uses less digits than its factorization.
141053331220213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1511187.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 141053331220213 its reverse (312022133350141), we get a palindrome (453075464570354).
The spelling of 141053331220213 in words is "one hundred forty-one trillion, fifty-three billion, three hundred thirty-one million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •