Base | Representation |
---|---|
bin | 10001000111101… |
… | …11111111100001 |
3 | 101000020202111112 |
4 | 20203313333201 |
5 | 243231401423 |
6 | 22130153105 |
7 | 3362524235 |
oct | 1043677741 |
9 | 330222445 |
10 | 143622113 |
11 | 74086468 |
12 | 40122795 |
13 | 239a7bcb |
14 | 151085c5 |
15 | c91ea78 |
hex | 88f7fe1 |
143622113 has 2 divisors, whose sum is σ = 143622114. Its totient is φ = 143622112.
The previous prime is 143622091. The next prime is 143622119. The reversal of 143622113 is 311226341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131033809 + 12588304 = 11447^2 + 3548^2 .
It is an emirp because it is prime and its reverse (311226341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 143622113 - 220 = 142573537 is a prime.
It is a super-2 number, since 2×1436221132 = 41254622685169538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (143622119) 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 as a sum of consecutive naturals, namely, 71811056 + 71811057.
It is an arithmetic number, because the mean of its divisors is an integer number (71811057).
Almost surely, 2143622113 is an apocalyptic number.
It is an amenable number.
143622113 is a deficient number, since it is larger than the sum of its proper divisors (1).
143622113 is an equidigital number, since it uses as much as digits as its factorization.
143622113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 864, while the sum is 23.
The square root of 143622113 is about 11984.2443649986. The cubic root of 143622113 is about 523.6893845545.
Adding to 143622113 its reverse (311226341), we get a palindrome (454848454).
The spelling of 143622113 in words is "one hundred forty-three million, six hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •