Search a number
-
+
1301155069 is a prime number
BaseRepresentation
bin100110110001110…
…0000110011111101
310100200100112012111
41031203200303331
510131043430234
6333040134021
744146431004
oct11543406375
93320315174
101301155069
11608517075
12303907311
13179750956
14c4b41c3b
157936c664
hex4d8e0cfd

1301155069 has 2 divisors, whose sum is σ = 1301155070. Its totient is φ = 1301155068.

The previous prime is 1301155013. The next prime is 1301155081. The reversal of 1301155069 is 9605511031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 940648900 + 360506169 = 30670^2 + 18987^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×13011550692 = 3386009027168789522, 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 1301155069.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1301155099) 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, 650577534 + 650577535.

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

Almost surely, 21301155069 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1301155069 is about 36071.5271232034. The cubic root of 1301155069 is about 1091.7160268832.

The spelling of 1301155069 in words is "one billion, three hundred one million, one hundred fifty-five thousand, sixty-nine".