[go: up one dir, main page]

Search a number
-
+
1060051189 is a prime number
BaseRepresentation
bin111111001011110…
…001100011110101
32201212200011212011
4333023301203311
54132333114224
6253104324221
735161200151
oct7713614365
92655604764
101060051189
114a440a16a
12257013671
1313b804532
14a0b00061
15630e4394
hex3f2f18f5

1060051189 has 2 divisors, whose sum is σ = 1060051190. Its totient is φ = 1060051188.

The previous prime is 1060050991. The next prime is 1060051217. The reversal of 1060051189 is 9811500601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1008570564 + 51480625 = 31758^2 + 7175^2 .

It is a cyclic number.

It is not a de Polignac number, because 1060051189 - 211 = 1060049141 is a prime.

It is a super-2 number, since 2×10600511892 = 2247417046600627442, 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 1060051189.

It is a congruent number.

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

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

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

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

Almost surely, 21060051189 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2160, while the sum is 31.

The square root of 1060051189 is about 32558.4273115272. The cubic root of 1060051189 is about 1019.6292350388.

The spelling of 1060051189 in words is "one billion, sixty million, fifty-one thousand, one hundred eighty-nine".