Base | Representation |
---|---|
bin | 100000000111010111111011… |
… | …001010010001011101100111 |
3 | 200112002211000002002011102200 |
4 | 200013113323022101131213 |
5 | 122003121122101200033 |
6 | 1220222410144105543 |
7 | 41515362163621416 |
oct | 4007277312213547 |
9 | 615084002064380 |
10 | 141244213303143 |
11 | 410063751a9395 |
12 | 13a120a93052b3 |
13 | 60a736cc33832 |
14 | 26c43837bd47d |
15 | 114e145a1a013 |
hex | 8075fb291767 |
141244213303143 has 144 divisors (see below), whose sum is σ = 220729615042560. Its totient is φ = 87001265894400.
The previous prime is 141244213303057. The next prime is 141244213303159. The reversal of 141244213303143 is 341303312442141.
141244213303143 is a `hidden beast` number, since 1 + 4 + 1 + 2 + 4 + 4 + 2 + 1 + 330 + 314 + 3 = 666.
It is not a de Polignac number, because 141244213303143 - 210 = 141244213302119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141244213303098 and 141244213303107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141244213303183) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 27001376338 + ... + 27001381568.
Almost surely, 2141244213303143 is an apocalyptic number.
141244213303143 is a deficient number, since it is larger than the sum of its proper divisors (79485401739417).
141244213303143 is a wasteful number, since it uses less digits than its factorization.
141244213303143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6078 (or 6058 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 36.
Adding to 141244213303143 its reverse (341303312442141), we get a palindrome (482547525745284).
The spelling of 141244213303143 in words is "one hundred forty-one trillion, two hundred forty-four billion, two hundred thirteen million, three hundred three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •