Base | Representation |
---|---|
bin | 10001000100000… |
… | …10100011101101 |
3 | 100222100022200021 |
4 | 20202002203231 |
5 | 243121003401 |
6 | 22112002141 |
7 | 3355451665 |
oct | 1042024355 |
9 | 328308607 |
10 | 143141101 |
11 | 73888034 |
12 | 3bb30351 |
13 | 23869c9c |
14 | 150211a5 |
15 | c8772a1 |
hex | 88828ed |
143141101 has 4 divisors (see below), whose sum is σ = 145102012. Its totient is φ = 141180192.
The previous prime is 143141093. The next prime is 143141111. The reversal of 143141101 is 101141341.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 64818601 + 78322500 = 8051^2 + 8850^2 .
It is a cyclic number.
It is not a de Polignac number, because 143141101 - 23 = 143141093 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 (143141111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 980346 + ... + 980491.
It is an arithmetic number, because the mean of its divisors is an integer number (36275503).
Almost surely, 2143141101 is an apocalyptic number.
It is an amenable number.
143141101 is a deficient number, since it is larger than the sum of its proper divisors (1960911).
143141101 is an equidigital number, since it uses as much as digits as its factorization.
143141101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1960910.
The product of its (nonzero) digits is 48, while the sum is 16.
The square root of 143141101 is about 11964.1590176661. The cubic root of 143141101 is about 523.1040925561.
Adding to 143141101 its reverse (101141341), we get a palindrome (244282442).
The spelling of 143141101 in words is "one hundred forty-three million, one hundred forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •