Base | Representation |
---|---|
bin | 100000000111001100100011… |
… | …110111000100011101100001 |
3 | 200112001122111200201210010100 |
4 | 200013030203313010131201 |
5 | 122002421124333424441 |
6 | 1220213031255253013 |
7 | 41514450620006304 |
oct | 4007144367043541 |
9 | 615048450653110 |
10 | 141232011233121 |
11 | 410011834805a6 |
12 | 13a0b86297a169 |
13 | 60a6176c6b763 |
14 | 26c3947000b3b |
15 | 114db7e681cb6 |
hex | 807323dc4761 |
141232011233121 has 12 divisors (see below), whose sum is σ = 212871437221248. Its totient is φ = 90060992670264.
The previous prime is 141232011233111. The next prime is 141232011233129. The reversal of 141232011233121 is 121332110232141.
141232011233121 is a `hidden beast` number, since 1 + 4 + 1 + 2 + 320 + 1 + 1 + 2 + 331 + 2 + 1 = 666.
It is not a de Polignac number, because 141232011233121 - 26 = 141232011233057 is a prime.
It is not an unprimeable number, because it can be changed into a prime (141232011233129) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 341140123545 + ... + 341140123958.
It is an arithmetic number, because the mean of its divisors is an integer number (17739286435104).
Almost surely, 2141232011233121 is an apocalyptic number.
It is an amenable number.
141232011233121 is a deficient number, since it is larger than the sum of its proper divisors (71639425988127).
141232011233121 is a wasteful number, since it uses less digits than its factorization.
141232011233121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 682280247532 (or 682280247529 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
Adding to 141232011233121 its reverse (121332110232141), we get a palindrome (262564121465262).
The spelling of 141232011233121 in words is "one hundred forty-one trillion, two hundred thirty-two billion, eleven million, two hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •