Base | Representation |
---|---|
bin | 100000000101111000111010… |
… | …111000100111011100111110 |
3 | 200111202001200211002001220010 |
4 | 200011320322320213130332 |
5 | 121444433213004420332 |
6 | 1220103455533404050 |
7 | 41505121241226000 |
oct | 4005707270473476 |
9 | 614661624061803 |
10 | 141142203201342 |
11 | 40a77088157032 |
12 | 139b637a339626 |
13 | 609a863b50a55 |
14 | 26bd4677d4370 |
15 | 114b6750c49cc |
hex | 805e3ae2773e |
141142203201342 has 64 divisors (see below), whose sum is σ = 329199867532800. Its totient is φ = 40325703772032.
The previous prime is 141142203201341. The next prime is 141142203201541. The reversal of 141142203201342 is 243102302241141.
It is a happy number.
It is a super-2 number, since 2×1411422032013422 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141142203201341) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 137690233 + ... + 138711515.
It is an arithmetic number, because the mean of its divisors is an integer number (5143747930200).
Almost surely, 2141142203201342 is an apocalyptic number.
141142203201342 is an abundant number, since it is smaller than the sum of its proper divisors (188057664331458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
141142203201342 is a wasteful number, since it uses less digits than its factorization.
141142203201342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1088462 (or 1088448 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 30.
Adding to 141142203201342 its reverse (243102302241141), we get a palindrome (384244505442483).
The spelling of 141142203201342 in words is "one hundred forty-one trillion, one hundred forty-two billion, two hundred three million, two hundred one thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •