Base | Representation |
---|---|
bin | 1000010110010011111… |
… | …1100111101100000000 |
3 | 111201012202200120200000 |
4 | 2011210333213230000 |
5 | 4322220122220000 |
6 | 145520130400000 |
7 | 13235200414230 |
oct | 2054477475400 |
9 | 451182616600 |
10 | 143428320000 |
11 | 55911602759 |
12 | 23969a30000 |
13 | 106a9c22204 |
14 | 6d28a8bcc0 |
15 | 3ae6bc0000 |
hex | 2164fe7b00 |
143428320000 has 2160 divisors, whose sum is σ = 669400123392. Its totient is φ = 29859840000.
The previous prime is 143428319989. The next prime is 143428320053. The reversal of 143428320000 is 23824341.
143428320000 is a `hidden beast` number, since 1 + 434 + 28 + 3 + 200 + 0 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (2160).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 4626719985 + ... + 4626720015.
Almost surely, 2143428320000 is an apocalyptic number.
143428320000 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 143428320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (334700061696).
143428320000 is an abundant number, since it is smaller than the sum of its proper divisors (525971803392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143428320000 is an frugal number, since it uses more digits than its factorization.
143428320000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106 (or 65 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The spelling of 143428320000 in words is "one hundred forty-three billion, four hundred twenty-eight million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •