Base | Representation |
---|---|
bin | 10001000100101… |
… | …10110100110001 |
3 | 100222111112112210 |
4 | 20202112310301 |
5 | 243131132423 |
6 | 22113442333 |
7 | 3356246004 |
oct | 1042266461 |
9 | 328445483 |
10 | 143224113 |
11 | 7393443a |
12 | 3bb703a9 |
13 | 238989c6 |
14 | 1504353b |
15 | c891b93 |
hex | 8896d31 |
143224113 has 4 divisors (see below), whose sum is σ = 190965488. Its totient is φ = 95482740.
The previous prime is 143224049. The next prime is 143224117. The reversal of 143224113 is 311422341.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 311422341 = 3 ⋅103807447.
It is not a de Polignac number, because 143224113 - 26 = 143224049 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 143224113.
It is not an unprimeable number, because it can be changed into a prime (143224117) 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, 23870683 + ... + 23870688.
It is an arithmetic number, because the mean of its divisors is an integer number (47741372).
Almost surely, 2143224113 is an apocalyptic number.
It is an amenable number.
143224113 is a deficient number, since it is larger than the sum of its proper divisors (47741375).
143224113 is an equidigital number, since it uses as much as digits as its factorization.
143224113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47741374.
The product of its digits is 576, while the sum is 21.
The square root of 143224113 is about 11967.6277097844. The cubic root of 143224113 is about 523.2051944876.
Adding to 143224113 its reverse (311422341), we get a palindrome (454646454).
The spelling of 143224113 in words is "one hundred forty-three million, two hundred twenty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •