Search a number
-
+
40153251 = 3193779241
BaseRepresentation
bin1001100100101…
…1000010100011
32210112222220110
42121023002203
540234401001
63552342403
7665203605
oct231130243
983488813
1040153251
1120735806
1211544a03
13841b528
145493175
1537d23d6
hex264b0a3

40153251 has 32 divisors (see below), whose sum is σ = 58854400. Its totient is φ = 24261120.

The previous prime is 40153249. The next prime is 40153273. The reversal of 40153251 is 15235104.

It is not a de Polignac number, because 40153251 - 21 = 40153249 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (40153231) 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 31 ways as a sum of consecutive naturals, for example, 166491 + ... + 166731.

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

Almost surely, 240153251 is an apocalyptic number.

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

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

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

The sum of its prime factors is 379.

The product of its (nonzero) digits is 600, while the sum is 21.

The square root of 40153251 is about 6336.6592933501. The cubic root of 40153251 is about 342.4313919443.

Adding to 40153251 its reverse (15235104), we get a palindrome (55388355).

It can be divided in two parts, 40153 and 251, that added together give a palindrome (40404).

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

Divisors: 1 3 19 37 57 79 111 237 241 703 723 1501 2109 2923 4503 4579 8769 8917 13737 19039 26751 55537 57117 166611 169423 361741 508269 704443 1085223 2113329 13384417 40153251