Search a number
-
+
1105152029 is a prime number
BaseRepresentation
bin100000111011111…
…0100100000011101
32212000112112120122
41001313310200131
54230404331104
6301355124325
736246431402
oct10167644035
92760475518
101105152029
11517914093
1226a1436a5
13147c65a17
14a6ac02a9
15670526be
hex41df481d

1105152029 has 2 divisors, whose sum is σ = 1105152030. Its totient is φ = 1105152028.

The previous prime is 1105152019. The next prime is 1105152049. The reversal of 1105152029 is 9202515011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 980316100 + 124835929 = 31310^2 + 11173^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1105152029 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

Almost surely, 21105152029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 900, while the sum is 26.

The square root of 1105152029 is about 33243.8269307250. The cubic root of 1105152029 is about 1033.8892231926.

The spelling of 1105152029 in words is "one billion, one hundred five million, one hundred fifty-two thousand, twenty-nine".