Base | Representation |
---|---|
bin | 100000100010011100000010… |
… | …010000011100010010000000 |
3 | 200202200121120111222001102112 |
4 | 200202130002100130102000 |
5 | 122224104100104400000 |
6 | 1224205032223434452 |
7 | 42066632562121244 |
oct | 4042340220342200 |
9 | 622617514861375 |
10 | 143104053200000 |
11 | 416630a7353192 |
12 | 14072635a55a28 |
13 | 61b08676aa519 |
14 | 274a3b7686424 |
15 | 11826e8bed235 |
hex | 82270241c480 |
143104053200000 has 96 divisors (see below), whose sum is σ = 356339826268020. Its totient is φ = 57241621120000.
The previous prime is 143104053199999. The next prime is 143104053200051. The reversal of 143104053200000 is 2350401341.
It can be written as a sum of positive squares in 6 ways, for example, as 90581737024 + 143013471462976 = 300968^2 + 11958824^2 .
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 178480067 + ... + 179280066.
Almost surely, 2143104053200000 is an apocalyptic number.
143104053200000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
143104053200000 is an abundant number, since it is smaller than the sum of its proper divisors (213235773068020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143104053200000 is an frugal number, since it uses more digits than its factorization.
143104053200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357760172 (or 357760140 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 23.
The spelling of 143104053200000 in words is "one hundred forty-three trillion, one hundred four billion, fifty-three million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •