Base | Representation |
---|---|
bin | 100000100010110100011010… |
… | …110001110100001010101110 |
3 | 200202210010011010112002122011 |
4 | 200202310122301310022232 |
5 | 122230021210001434200 |
6 | 1224225042201511434 |
7 | 42101550431522500 |
oct | 4042643261641256 |
9 | 622703133462564 |
10 | 143130234405550 |
11 | 41673211a19447 |
12 | 14077721aa257a |
13 | 61b317a857722 |
14 | 274b77c869d70 |
15 | 118322c4475ba |
hex | 822d1ac742ae |
143130234405550 has 72 divisors (see below), whose sum is σ = 309763446375024. Its totient is φ = 49061123879040.
The previous prime is 143130234405523. The next prime is 143130234405559. The reversal of 143130234405550 is 55504432031341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143130234405559) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2739687 + ... + 17139613.
It is an arithmetic number, because the mean of its divisors is an integer number (4302270088542).
Almost surely, 2143130234405550 is an apocalyptic number.
143130234405550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
143130234405550 is an abundant number, since it is smaller than the sum of its proper divisors (166633211969474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
143130234405550 is a wasteful number, since it uses less digits than its factorization.
143130234405550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14404010 (or 14403998 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 40.
Adding to 143130234405550 its reverse (55504432031341), we get a palindrome (198634666436891).
The spelling of 143130234405550 in words is "one hundred forty-three trillion, one hundred thirty billion, two hundred thirty-four million, four hundred five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •