Base | Representation |
---|---|
bin | 100000100010110110000100… |
… | …111111010000111001100010 |
3 | 200202210021202022111112020120 |
4 | 200202312010333100321202 |
5 | 122230033332134103002 |
6 | 1224225535054221110 |
7 | 42101642536515630 |
oct | 4042660477207142 |
9 | 622707668445216 |
10 | 143132016316002 |
11 | 41673a4684810a |
12 | 14077b3a7b4796 |
13 | 61b33a2a82acc |
14 | 274b8ab394350 |
15 | 11832d3acacbc |
hex | 822d84fd0e62 |
143132016316002 has 256 divisors, whose sum is σ = 352739515392000. Its totient is φ = 37836888680448.
The previous prime is 143132016316001. The next prime is 143132016316013. The reversal of 143132016316002 is 200613610231341.
It is not an unprimeable number, because it can be changed into a prime (143132016316001) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 10603150249 + ... + 10603163747.
It is an arithmetic number, because the mean of its divisors is an integer number (1377888732000).
Almost surely, 2143132016316002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 143132016316002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (176369757696000).
143132016316002 is an abundant number, since it is smaller than the sum of its proper divisors (209607499075998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143132016316002 is a wasteful number, since it uses less digits than its factorization.
143132016316002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16497.
The product of its (nonzero) digits is 15552, while the sum is 33.
Adding to 143132016316002 its reverse (200613610231341), we get a palindrome (343745626547343).
The spelling of 143132016316002 in words is "one hundred forty-three trillion, one hundred thirty-two billion, sixteen million, three hundred sixteen thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •