Search a number
-
+
40652261163 = 324516917907
BaseRepresentation
bin100101110111000100…
…000100011100101011
310212221010101211121100
4211313010010130223
51131223434324123
630401515012443
72636254342563
oct456704043453
9125833354540
1040652261163
1116271161558
127a6643a123
133aab248807
141d79079da3
1510cddc9643
hex97710472b

40652261163 has 6 divisors (see below), whose sum is σ = 58719932804. Its totient is φ = 27101507436.

The previous prime is 40652261159. The next prime is 40652261179. The reversal of 40652261163 is 36116225604.

It is not a de Polignac number, because 40652261163 - 22 = 40652261159 is a prime.

It is a super-2 number, since 2×406522611632 (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 (40652261113) 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 5 ways as a sum of consecutive naturals, for example, 2258458945 + ... + 2258458962.

Almost surely, 240652261163 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 51840, while the sum is 36.

Adding to 40652261163 its reverse (36116225604), we get a palindrome (76768486767).

The spelling of 40652261163 in words is "forty billion, six hundred fifty-two million, two hundred sixty-one thousand, one hundred sixty-three".

Divisors: 1 3 9 4516917907 13550753721 40652261163