Base | Representation |
---|---|
bin | 1000010110010000101… |
… | …0010000011100000101 |
3 | 111201011210100212120010 |
4 | 2011210022100130011 |
5 | 4322203032044031 |
6 | 145514510500433 |
7 | 13234640462334 |
oct | 2054412203405 |
9 | 451153325503 |
10 | 143414331141 |
11 | 55904718714 |
12 | 23965204719 |
13 | 106a7064b93 |
14 | 6d26c89d1b |
15 | 3ae585a246 |
hex | 2164290705 |
143414331141 has 8 divisors (see below), whose sum is σ = 193075604800. Its totient is φ = 94681305792.
The previous prime is 143414331133. The next prime is 143414331191. The reversal of 143414331141 is 141133414341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 143414331141 - 23 = 143414331133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 143414331099 and 143414331108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143414331101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 232061716 + ... + 232062333.
It is an arithmetic number, because the mean of its divisors is an integer number (24134450600).
Almost surely, 2143414331141 is an apocalyptic number.
It is an amenable number.
143414331141 is a deficient number, since it is larger than the sum of its proper divisors (49661273659).
143414331141 is a wasteful number, since it uses less digits than its factorization.
143414331141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 464124155.
The product of its digits is 6912, while the sum is 30.
Adding to 143414331141 its reverse (141133414341), we get a palindrome (284547745482).
The spelling of 143414331141 in words is "one hundred forty-three billion, four hundred fourteen million, three hundred thirty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •