Base | Representation |
---|---|
bin | 1000010100111000001… |
… | …1111000010001001001 |
3 | 111200012221200202212221 |
4 | 2011032003320101021 |
5 | 4320423122414041 |
6 | 145414023534041 |
7 | 13222516126411 |
oct | 2051603702111 |
9 | 450187622787 |
10 | 143043560521 |
11 | 557343a7214 |
12 | 23880bba321 |
13 | 106482b8894 |
14 | 6ccd933641 |
15 | 3ac301c2d1 |
hex | 214e0f8449 |
143043560521 has 9 divisors (see below), whose sum is σ = 144363767431. Its totient is φ = 141735328672.
The previous prime is 143043560519. The next prime is 143043560557. The reversal of 143043560521 is 125065340341.
The square root of 143043560521 is 378211.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 2520542025 + 140523018496 = 50205^2 + 374864^2 .
It is not a de Polignac number, because 143043560521 - 21 = 143043560519 is a prime.
It is a super-2 number, since 2×1430435605212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (143043560321) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 42736170 + ... + 42739516.
Almost surely, 2143043560521 is an apocalyptic number.
143043560521 is the 378211-st square number.
143043560521 is the 189106-th centered octagonal number.
It is an amenable number.
143043560521 is a deficient number, since it is larger than the sum of its proper divisors (1320206910).
143043560521 is an frugal number, since it uses more digits than its factorization.
143043560521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6920 (or 3460 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 34.
The spelling of 143043560521 in words is "one hundred forty-three billion, forty-three million, five hundred sixty thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •