Base | Representation |
---|---|
bin | 1000010101100010100… |
… | …1010011001100100111 |
3 | 111200200022211212022021 |
4 | 2011120221103030213 |
5 | 4321304103023221 |
6 | 145443410044011 |
7 | 13230103423522 |
oct | 2053051231447 |
9 | 450608755267 |
10 | 143221142311 |
11 | 55815668025 |
12 | 23910579607 |
13 | 10676023b70 |
14 | 6d0935bbb9 |
15 | 3ad38e9041 |
hex | 2158a53327 |
143221142311 has 4 divisors (see below), whose sum is σ = 154238153272. Its totient is φ = 132204131352.
The previous prime is 143221142297. The next prime is 143221142329. The reversal of 143221142311 is 113241122341.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113241122341 = 176357 ⋅642113.
It is a cyclic number.
It is not a de Polignac number, because 143221142311 - 215 = 143221109543 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143221142011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5508505461 + ... + 5508505486.
It is an arithmetic number, because the mean of its divisors is an integer number (38559538318).
Almost surely, 2143221142311 is an apocalyptic number.
143221142311 is a deficient number, since it is larger than the sum of its proper divisors (11017010961).
143221142311 is a wasteful number, since it uses less digits than its factorization.
143221142311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11017010960.
The product of its digits is 1152, while the sum is 25.
Adding to 143221142311 its reverse (113241122341), we get a palindrome (256462264652).
The spelling of 143221142311 in words is "one hundred forty-three billion, two hundred twenty-one million, one hundred forty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •