[go: up one dir, main page]

Search a number
-
+
143109931 = 509281159
BaseRepresentation
bin10001000011110…
…10111100101011
3100222021201220211
420201322330223
5243114004211
622111201551
73355262056
oct1041727453
9328251824
10143109931
1173866678
123bb162b7
1323858a43
1415013a9d
15c86ce21
hex887af2b

143109931 has 4 divisors (see below), whose sum is σ = 143391600. Its totient is φ = 142828264.

The previous prime is 143109917. The next prime is 143109947. The reversal of 143109931 is 139901341.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 139901341 = 236082667.

It is a cyclic number.

It is not a de Polignac number, because 143109931 - 25 = 143109899 is a prime.

It is a super-2 number, since 2×1431099312 = 40960904701649522, which contains 22 as substring.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 143109893 and 143109902.

It is not an unprimeable number, because it can be changed into a prime (143109431) 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, 140071 + ... + 141088.

It is an arithmetic number, because the mean of its divisors is an integer number (35847900).

Almost surely, 2143109931 is an apocalyptic number.

143109931 is a deficient number, since it is larger than the sum of its proper divisors (281669).

143109931 is an equidigital number, since it uses as much as digits as its factorization.

143109931 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 281668.

The product of its (nonzero) digits is 2916, while the sum is 31.

The square root of 143109931 is about 11962.8563060834. The cubic root of 143109931 is about 523.0661199121.

The spelling of 143109931 in words is "one hundred forty-three million, one hundred nine thousand, nine hundred thirty-one".

Divisors: 1 509 281159 143109931