Search a number
-
+
11641246431 = 33880415477
BaseRepresentation
bin10101101011101111…
…10101001011011111
31010001022001120222020
422311313311023133
5142320124341211
65203052151223
7561323650653
oct126567651337
933038046866
1011641246431
114a341a8821
12230a768513
131136a351c9
147c6112a63
15482008306
hex2b5df52df

11641246431 has 4 divisors (see below), whose sum is σ = 15521661912. Its totient is φ = 7760830952.

The previous prime is 11641246411. The next prime is 11641246433. The reversal of 11641246431 is 13464214611.

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 11641246431 - 27 = 11641246303 is a prime.

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

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 211641246431 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3880415480.

The product of its digits is 13824, while the sum is 33.

The spelling of 11641246431 in words is "eleven billion, six hundred forty-one million, two hundred forty-six thousand, four hundred thirty-one".

Divisors: 1 3 3880415477 11641246431