Search a number
-
+
32113141 = 270711863
BaseRepresentation
bin111101010000…
…0000111110101
32020102111221121
41322200013311
531210110031
63104143541
7536646214
oct172400765
966374847
1032113141
1117144095
12a907bb1
136864a78
14439d07b
152c45011
hex1ea01f5

32113141 has 4 divisors (see below), whose sum is σ = 32127712. Its totient is φ = 32098572.

The previous prime is 32113139. The next prime is 32113163. The reversal of 32113141 is 14131123.

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.

It is a cyclic number.

It is not a de Polignac number, because 32113141 - 21 = 32113139 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 (32113171) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3225 + ... + 8638.

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

Almost surely, 232113141 is an apocalyptic number.

It is an amenable number.

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

32113141 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 14570.

The product of its digits is 72, while the sum is 16.

The square root of 32113141 is about 5666.8457716793. The cubic root of 32113141 is about 317.8539372459.

Adding to 32113141 its reverse (14131123), we get a palindrome (46244264).

The spelling of 32113141 in words is "thirty-two million, one hundred thirteen thousand, one hundred forty-one".

Divisors: 1 2707 11863 32113141