Base | Representation |
---|---|
bin | 1000010110010111100… |
… | …0000101101110111100 |
3 | 111201020210112122202011 |
4 | 2011211320011232330 |
5 | 4322232414420012 |
6 | 145521415541004 |
7 | 13235440300111 |
oct | 2054570055674 |
9 | 451223478664 |
10 | 143443123132 |
11 | 559199a3551 |
12 | 2397298a764 |
13 | 106b000606a |
14 | 6d2aa22908 |
15 | 3ae81461a7 |
hex | 2165e05bbc |
143443123132 has 6 divisors (see below), whose sum is σ = 251025465488. Its totient is φ = 71721561564.
The previous prime is 143443123127. The next prime is 143443123133. The reversal of 143443123132 is 231321344341.
143443123132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1434431231322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 143443123094 and 143443123103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143443123133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17930390388 + ... + 17930390395.
Almost surely, 2143443123132 is an apocalyptic number.
It is an amenable number.
143443123132 is a deficient number, since it is larger than the sum of its proper divisors (107582342356).
143443123132 is a wasteful number, since it uses less digits than its factorization.
143443123132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35860780787 (or 35860780785 counting only the distinct ones).
The product of its digits is 20736, while the sum is 31.
Adding to 143443123132 its reverse (231321344341), we get a palindrome (374764467473).
The spelling of 143443123132 in words is "one hundred forty-three billion, four hundred forty-three million, one hundred twenty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •