Base | Representation |
---|---|
bin | 1000010110010011000… |
… | …0010011001110000000 |
3 | 111201012111010112202021 |
4 | 2011210300103032000 |
5 | 4322213110212000 |
6 | 145515504331224 |
7 | 13235121316615 |
oct | 2054460231600 |
9 | 451174115667 |
10 | 143424304000 |
11 | 5590a30a44a |
12 | 23968613b14 |
13 | 106a9147293 |
14 | 6d2832450c |
15 | 3ae667a11a |
hex | 2164c13380 |
143424304000 has 64 divisors (see below), whose sum is σ = 356588715600. Its totient is φ = 57369715200.
The previous prime is 143424303977. The next prime is 143424304003. The reversal of 143424304000 is 403424341.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143424304003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4466010 + ... + 4498009.
Almost surely, 2143424304000 is an apocalyptic number.
143424304000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
143424304000 is an abundant number, since it is smaller than the sum of its proper divisors (213164411600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143424304000 is an frugal number, since it uses more digits than its factorization.
143424304000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8964048 (or 8964026 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 143424304000 its reverse (403424341), we get a palindrome (143827728341).
The spelling of 143424304000 in words is "one hundred forty-three billion, four hundred twenty-four million, three hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •