Search a number
-
+
1168379249 is a prime number
BaseRepresentation
bin100010110100100…
…0000110101110001
310000102111211000112
41011221000311301
54343101113444
6311534231105
740645026332
oct10551006561
93012454015
101168379249
1154a579694
12287355495
131580a288b
14b125c289
156c89169e
hex45a40d71

1168379249 has 2 divisors, whose sum is σ = 1168379250. Its totient is φ = 1168379248.

The previous prime is 1168379237. The next prime is 1168379291. The reversal of 1168379249 is 9429738611.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1153825024 + 14554225 = 33968^2 + 3815^2 .

It is a cyclic number.

It is not a de Polignac number, because 1168379249 - 28 = 1168378993 is a prime.

It is a super-3 number, since 3×11683792493 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

It is not a weakly prime, because it can be changed into another prime (1168375249) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 584189624 + 584189625.

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

Almost surely, 21168379249 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 653184, while the sum is 50.

The square root of 1168379249 is about 34181.5629982012. The cubic root of 1168379249 is about 1053.2414566176.

The spelling of 1168379249 in words is "one billion, one hundred sixty-eight million, three hundred seventy-nine thousand, two hundred forty-nine".