Search a number
-
+
40664213301 = 313554737767
BaseRepresentation
bin100101110111110001…
…101010011100110101
310212221221220001212010
4211313301222130311
51131240014311201
630403023114433
72636461052505
oct456761523465
9125857801763
1040664213301
1116277985358
127a6a442a19
133ab0871a9a
141d7a8aba05
1510cee8abd6
hex977c6a735

40664213301 has 4 divisors (see below), whose sum is σ = 54218951072. Its totient is φ = 27109475532.

The previous prime is 40664213287. The next prime is 40664213311. The reversal of 40664213301 is 10331246604.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 40664213301 - 27 = 40664213173 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (40664213311) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6777368881 + ... + 6777368886.

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

Almost surely, 240664213301 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13554737770.

The product of its (nonzero) digits is 10368, while the sum is 30.

Adding to 40664213301 its reverse (10331246604), we get a palindrome (50995459905).

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

Divisors: 1 3 13554737767 40664213301