Base | Representation |
---|---|
bin | 1000010100110111011… |
… | …1111101000001111101 |
3 | 111200012201210221112000 |
4 | 2011031313331001331 |
5 | 4320421322344201 |
6 | 145413432532513 |
7 | 13222450426152 |
oct | 2051567750175 |
9 | 450181727460 |
10 | 143040434301 |
11 | 55732661466 |
12 | 2387bb51139 |
13 | 1064776294b |
14 | 6ccd35c229 |
15 | 3ac2b00d86 |
hex | 214ddfd07d |
143040434301 has 32 divisors (see below), whose sum is σ = 219265939200. Its totient is φ = 92052313920.
The previous prime is 143040434249. The next prime is 143040434389. The reversal of 143040434301 is 103434040341.
143040434301 is a `hidden beast` number, since 14 + 304 + 0 + 4 + 343 + 0 + 1 = 666.
It is not a de Polignac number, because 143040434301 - 233 = 134450499709 is a prime.
It is a super-3 number, since 3×1430404343013 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143040434101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4235655 + ... + 4269291.
It is an arithmetic number, because the mean of its divisors is an integer number (6852060600).
Almost surely, 2143040434301 is an apocalyptic number.
It is an amenable number.
143040434301 is a deficient number, since it is larger than the sum of its proper divisors (76225504899).
143040434301 is a wasteful number, since it uses less digits than its factorization.
143040434301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39106 (or 39100 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 143040434301 its reverse (103434040341), we get a palindrome (246474474642).
The spelling of 143040434301 in words is "one hundred forty-three billion, forty million, four hundred thirty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •