Base | Representation |
---|---|
bin | 10001001010011… |
… | …10011001000001 |
3 | 101000220201221111 |
4 | 20211032121001 |
5 | 243324213001 |
6 | 22141523321 |
7 | 3365530051 |
oct | 1045163101 |
9 | 330821844 |
10 | 143976001 |
11 | 742a8334 |
12 | 40273541 |
13 | 23aa0000 |
14 | 1519b561 |
15 | c98e851 |
hex | 894e641 |
143976001 has 15 divisors (see below), whose sum is σ = 158201333. Its totient is φ = 131029080.
The previous prime is 143975987. The next prime is 143976031. The reversal of 143976001 is 100679341.
It is a happy number.
The square root of 143976001 is 11999.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 71385601 + 72590400 = 8449^2 + 8520^2 .
It is not a de Polignac number, because 143976001 - 211 = 143973953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (143976031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 2027796 + ... + 2027866.
Almost surely, 2143976001 is an apocalyptic number.
143976001 is the 11999-th square number.
143976001 is the 6000-th centered octagonal number.
It is an amenable number.
143976001 is a deficient number, since it is larger than the sum of its proper divisors (14225332).
143976001 is an frugal number, since it uses more digits than its factorization.
143976001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194 (or 84 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 31.
The cubic root of 143976001 is about 524.1191590885.
It can be divided in two parts, 143 and 976001, that added together give a square (976144 = 9882).
The spelling of 143976001 in words is "one hundred forty-three million, nine hundred seventy-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •