Base | Representation |
---|---|
bin | 1000010110010111010… |
… | …1000001110000101111 |
3 | 111201020202000212122111 |
4 | 2011211311001300233 |
5 | 4322232213223211 |
6 | 145521350424451 |
7 | 13235430414634 |
oct | 2054565016057 |
9 | 451222025574 |
10 | 143442320431 |
11 | 559194a5463 |
12 | 23972662127 |
13 | 106acab48a7 |
14 | 6d2a89418b |
15 | 3ae8038421 |
hex | 2165d41c2f |
143442320431 has 8 divisors (see below), whose sum is σ = 146842976720. Its totient is φ = 140044609152.
The previous prime is 143442320429. The next prime is 143442320443. The reversal of 143442320431 is 134023244341.
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 143442320431 - 21 = 143442320429 is a prime.
It is a super-2 number, since 2×1434423204312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 143442320393 and 143442320402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143442320531) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 637530 + ... + 832663.
It is an arithmetic number, because the mean of its divisors is an integer number (18355372090).
Almost surely, 2143442320431 is an apocalyptic number.
143442320431 is a deficient number, since it is larger than the sum of its proper divisors (3400656289).
143442320431 is a wasteful number, since it uses less digits than its factorization.
143442320431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1472505.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 143442320431 its reverse (134023244341), we get a palindrome (277465564772).
The spelling of 143442320431 in words is "one hundred forty-three billion, four hundred forty-two million, three hundred twenty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •