Base | Representation |
---|---|
bin | 1000010100111000001… |
… | …0001111001101100101 |
3 | 111200012220212220121121 |
4 | 2011032002033031211 |
5 | 4320423020131323 |
6 | 145414010413541 |
7 | 13222512355024 |
oct | 2051602171545 |
9 | 450186786547 |
10 | 143043130213 |
11 | 55734132995 |
12 | 23880a312b1 |
13 | 10648197a69 |
14 | 6ccd8608bb |
15 | 3ac2e84a5d |
hex | 214e08f365 |
143043130213 has 8 divisors (see below), whose sum is σ = 154077313536. Its totient is φ = 132410190000.
The previous prime is 143043130207. The next prime is 143043130229. The reversal of 143043130213 is 312031340341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 143043130213 - 221 = 143041033061 is a prime.
It is a super-2 number, since 2×1430431302132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143043130253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 100310038 + ... + 100311463.
It is an arithmetic number, because the mean of its divisors is an integer number (19259664192).
Almost surely, 2143043130213 is an apocalyptic number.
It is an amenable number.
143043130213 is a deficient number, since it is larger than the sum of its proper divisors (11034183323).
143043130213 is a wasteful number, since it uses less digits than its factorization.
143043130213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200621555.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 143043130213 its reverse (312031340341), we get a palindrome (455074470554).
The spelling of 143043130213 in words is "one hundred forty-three billion, forty-three million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •