Base | Representation |
---|---|
bin | 100000100010110001000010… |
… | …001101100101110111001000 |
3 | 200202202202202220200112220112 |
4 | 200202301002031211313020 |
5 | 122224441234330443422 |
6 | 1224223241450013452 |
7 | 42101361412406216 |
oct | 4042610215456710 |
9 | 622682686615815 |
10 | 143126601031112 |
11 | 41671717a85456 |
12 | 14076a89117288 |
13 | 61b2a1bb9071a |
14 | 274b5160adcb6 |
15 | 11830b8491ee2 |
hex | 822c42365dc8 |
143126601031112 has 32 divisors (see below), whose sum is σ = 268498491163200. Its totient is φ = 71527005326784.
The previous prime is 143126601031033. The next prime is 143126601031177. The reversal of 143126601031112 is 211130106621341.
It is a super-2 number, since 2×1431266010311122 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 727396439 + ... + 727593177.
It is an arithmetic number, because the mean of its divisors is an integer number (8390577848850).
Almost surely, 2143126601031112 is an apocalyptic number.
It is an amenable number.
143126601031112 is a deficient number, since it is larger than the sum of its proper divisors (125371890132088).
143126601031112 is a wasteful number, since it uses less digits than its factorization.
143126601031112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242405 (or 242401 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 32.
Adding to 143126601031112 its reverse (211130106621341), we get a palindrome (354256707652453).
The spelling of 143126601031112 in words is "one hundred forty-three trillion, one hundred twenty-six billion, six hundred one million, thirty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.229 sec. • engine limits •