Base | Representation |
---|---|
bin | 100000100010110101101001… |
… | …001110100000100001110110 |
3 | 200202210020112212002011120212 |
4 | 200202311221032200201312 |
5 | 122230031403420101014 |
6 | 1224225420535225422 |
7 | 42101625152543636 |
oct | 4042655116404166 |
9 | 622706485064525 |
10 | 143131550550134 |
11 | 41673827943343 |
12 | 14077a2a818272 |
13 | 61b332a425cc3 |
14 | 274b8655906c6 |
15 | 11832a7c7623e |
hex | 822d693a0876 |
143131550550134 has 8 divisors (see below), whose sum is σ = 214697606376288. Its totient is φ = 71565681758040.
The previous prime is 143131550550119. The next prime is 143131550550139. The reversal of 143131550550134 is 431055055131341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 143131550550091 and 143131550550100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143131550550139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44829422 + ... + 47915969.
It is an arithmetic number, because the mean of its divisors is an integer number (26837200797036).
Almost surely, 2143131550550134 is an apocalyptic number.
143131550550134 is a deficient number, since it is larger than the sum of its proper divisors (71566055826154).
143131550550134 is an equidigital number, since it uses as much as digits as its factorization.
143131550550134 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93517030.
The product of its (nonzero) digits is 270000, while the sum is 41.
The spelling of 143131550550134 in words is "one hundred forty-three trillion, one hundred thirty-one billion, five hundred fifty million, five hundred fifty thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •