Search a number
-
+
40563072 = 273311297
BaseRepresentation
bin1001101010111…
…1000110000000
32211022211002000
42122233012000
540341004242
64005224000
71001531454
oct232570600
984284060
1040563072
1120995700
1211702000
138532c24
14555c664
153863a4c
hex26af180

40563072 has 192 divisors, whose sum is σ = 132946800. Its totient is φ = 12165120.

The previous prime is 40563059. The next prime is 40563079. The reversal of 40563072 is 27036504.

It is a happy number.

It is a tau number, because it is divible by the number of its divisors (192).

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a congruent number.

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

Almost surely, 240563072 is an apocalyptic number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 40563072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66473400).

40563072 is an abundant number, since it is smaller than the sum of its proper divisors (92383728).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 142 (or 113 counting only the distinct ones).

The product of its (nonzero) digits is 5040, while the sum is 27.

The square root of 40563072 is about 6368.9145071982. The cubic root of 40563072 is about 343.5924504687.

Adding to 40563072 its reverse (27036504), we get a palindrome (67599576).

The spelling of 40563072 in words is "forty million, five hundred sixty-three thousand, seventy-two".