Base | Representation |
---|---|
bin | 100000100010110110010000… |
… | …000000001100101001101110 |
3 | 200202210022020012020001010101 |
4 | 200202312100000030221232 |
5 | 122230034221441011001 |
6 | 1224230005255101314 |
7 | 42101650242322204 |
oct | 4042662000145156 |
9 | 622708205201111 |
10 | 143132201110126 |
11 | 41674031094728 |
12 | 14077b9067183a |
13 | 61b3402144b47 |
14 | 274b8c7b39074 |
15 | 11832e4e2ea01 |
hex | 822d9000ca6e |
143132201110126 has 8 divisors (see below), whose sum is σ = 221624053331904. Its totient is φ = 69257516666160.
The previous prime is 143132201110069. The next prime is 143132201110163. The reversal of 143132201110126 is 621011102231341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 143132201110094 and 143132201110103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1154291944375 + ... + 1154291944498.
It is an arithmetic number, because the mean of its divisors is an integer number (27703006666488).
Almost surely, 2143132201110126 is an apocalyptic number.
143132201110126 is a deficient number, since it is larger than the sum of its proper divisors (78491852221778).
143132201110126 is a wasteful number, since it uses less digits than its factorization.
143132201110126 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2308583888906.
The product of its (nonzero) digits is 1728, while the sum is 28.
Adding to 143132201110126 its reverse (621011102231341), we get a palindrome (764143303341467).
The spelling of 143132201110126 in words is "one hundred forty-three trillion, one hundred thirty-two billion, two hundred one million, one hundred ten thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •