Base | Representation |
---|---|
bin | 100000000100001010010011… |
… | …011101010110000110011001 |
3 | 200111022201010022121102020210 |
4 | 200010022103131112012121 |
5 | 121441011441103442223 |
6 | 1215533134110441333 |
7 | 41463415030661100 |
oct | 4004122335260631 |
9 | 614281108542223 |
10 | 141023430140313 |
11 | 40a30778928366 |
12 | 13997351503249 |
13 | 608c5b5c00796 |
14 | 26b77db3d1037 |
15 | 1148522bcb893 |
hex | 804293756199 |
141023430140313 has 24 divisors (see below), whose sum is σ = 219083578929120. Its totient is φ = 80454631682880.
The previous prime is 141023430140311. The next prime is 141023430140381. The reversal of 141023430140313 is 313041034320141.
It is not a de Polignac number, because 141023430140313 - 21 = 141023430140311 is a prime.
It is not an unprimeable number, because it can be changed into a prime (141023430140311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 774822628 + ... + 775004613.
It is an arithmetic number, because the mean of its divisors is an integer number (9128482455380).
Almost surely, 2141023430140313 is an apocalyptic number.
It is an amenable number.
141023430140313 is a deficient number, since it is larger than the sum of its proper divisors (78060148788807).
141023430140313 is a wasteful number, since it uses less digits than its factorization.
141023430140313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1549827877 (or 1549827870 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 141023430140313 its reverse (313041034320141), we get a palindrome (454064464460454).
The spelling of 141023430140313 in words is "one hundred forty-one trillion, twenty-three billion, four hundred thirty million, one hundred forty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •