Search a number
-
+
40151564065 = 58030312813
BaseRepresentation
bin100101011001001110…
…000011111100100001
310211122020020210022101
4211121032003330201
51124212300022230
630240111210401
72620664443354
oct453116037441
9124566223271
1040151564065
11160345693a8
127946816a01
133a2b5ab342
141d2c78229b
15109ee74aca
hex959383f21

40151564065 has 4 divisors (see below), whose sum is σ = 48181876884. Its totient is φ = 32121251248.

The previous prime is 40151563939. The next prime is 40151564069. The reversal of 40151564065 is 56046515104.

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

It can be written as a sum of positive squares in 2 ways, for example, as 4756033296 + 35395530769 = 68964^2 + 188137^2 .

It is a cyclic number.

It is not a de Polignac number, because 40151564065 - 221 = 40149466913 is a prime.

It is a super-2 number, since 2×401515640652 (a number of 22 digits) contains 22 as substring.

It is a Duffinian number.

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

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

Almost surely, 240151564065 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 8030312818.

The product of its (nonzero) digits is 72000, while the sum is 37.

The spelling of 40151564065 in words is "forty billion, one hundred fifty-one million, five hundred sixty-four thousand, sixty-five".

Divisors: 1 5 8030312813 40151564065