Search a number
-
+
40165215131 = 311295652101
BaseRepresentation
bin100101011010000010…
…001000101110011011
310211200011221100001102
4211122002020232123
51124224243341011
630241315542015
72621221460366
oct453202105633
9124604840042
1040165215131
1116041242678
12794b2ba90b
133a3137a9b2
141d304d70dd
1510a126e73b
hex95a088b9b

40165215131 has 4 divisors (see below), whose sum is σ = 41460867264. Its totient is φ = 38869563000.

The previous prime is 40165215127. The next prime is 40165215133. The reversal of 40165215131 is 13151256104.

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

It is a cyclic number.

It is not a de Polignac number, because 40165215131 - 22 = 40165215127 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 40165215094 and 40165215103.

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

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

Almost surely, 240165215131 is an apocalyptic number.

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

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

40165215131 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1295652132.

The product of its (nonzero) digits is 3600, while the sum is 29.

The spelling of 40165215131 in words is "forty billion, one hundred sixty-five million, two hundred fifteen thousand, one hundred thirty-one".

Divisors: 1 31 1295652101 40165215131