Base | Representation |
---|---|
bin | 1000010101001101010… |
… | …1110000001010100000 |
3 | 111200110010100200010002 |
4 | 2011103111300022200 |
5 | 4321113311211000 |
6 | 145430510155132 |
7 | 13224643022324 |
oct | 2052325601240 |
9 | 450403320102 |
10 | 143132132000 |
11 | 5577a3a2290 |
12 | 238a67b2aa8 |
13 | 1066075a540 |
14 | 6cdb5cb984 |
15 | 3acabb58d5 |
hex | 21535702a0 |
143132132000 has 384 divisors, whose sum is σ = 424386563328. Its totient is φ = 46738944000.
The previous prime is 143132131999. The next prime is 143132132023. The reversal of 143132132000 is 231231341.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 21160619 + ... + 21167381.
It is an arithmetic number, because the mean of its divisors is an integer number (1105173342).
Almost surely, 2143132132000 is an apocalyptic number.
143132132000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 143132132000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (212193281664).
143132132000 is an abundant number, since it is smaller than the sum of its proper divisors (281254431328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143132132000 is a wasteful number, since it uses less digits than its factorization.
143132132000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6849 (or 6831 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 143132132000 its reverse (231231341), we get a palindrome (143363363341).
The spelling of 143132132000 in words is "one hundred forty-three billion, one hundred thirty-two million, one hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •