Search a number
-
+
40201151 = 325712343
BaseRepresentation
bin1001100101011…
…0101110111111
32210122102121112
42121112232333
540242414101
63553352235
7665463344
oct231265677
983572545
1040201151
11207687a1
121156867b
138437283
1454a67cb
1537e16bb
hex2656bbf

40201151 has 4 divisors (see below), whose sum is σ = 40216752. Its totient is φ = 40185552.

The previous prime is 40201103. The next prime is 40201157. The reversal of 40201151 is 15110204.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 40201151 - 222 = 36006847 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (40201157) 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 in 3 ways as a sum of consecutive naturals, for example, 2915 + ... + 9428.

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

Almost surely, 240201151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 15600.

The product of its (nonzero) digits is 40, while the sum is 14.

The square root of 40201151 is about 6340.4377609121. The cubic root of 40201151 is about 342.5675033447.

Adding to 40201151 its reverse (15110204), we get a palindrome (55311355).

The spelling of 40201151 in words is "forty million, two hundred one thousand, one hundred fifty-one".

Divisors: 1 3257 12343 40201151