Search a number
-
+
3132111469 is a prime number
BaseRepresentation
bin1011101010110000…
…0011101001101101
322002021121202012111
42322230003221231
522403310031334
61234444004021
7140421336214
oct27254035155
98067552174
103132111469
111367aa4783
12734b30611
133abb8c0c6
14219d9607b
15134e8d064
hexbab03a6d

3132111469 has 2 divisors, whose sum is σ = 3132111470. Its totient is φ = 3132111468.

The previous prime is 3132111419. The next prime is 3132111481. The reversal of 3132111469 is 9641112313.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3131745444 + 366025 = 55962^2 + 605^2 .

It is a cyclic number.

It is not a de Polignac number, because 3132111469 - 231 = 984627821 is a prime.

It is a super-2 number, since 2×31321114692 = 19620244508482675922, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 3132111469.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (3132111419) 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 as a sum of consecutive naturals, namely, 1566055734 + 1566055735.

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

Almost surely, 23132111469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3888, while the sum is 31.

The square root of 3132111469 is about 55965.2702039399. The cubic root of 3132111469 is about 1463.1170455298.

The spelling of 3132111469 in words is "three billion, one hundred thirty-two million, one hundred eleven thousand, four hundred sixty-nine".