Search a number
-
+
1320030104269 is a prime number
BaseRepresentation
bin10011001101010111111…
…011001110101011001101
311200012020011112011202211
4103031113323032223031
5133111410201314034
62450225150150421
7164240401520002
oct23152773165315
94605204464684
101320030104269
11469904642a78
121939b74b2411
139762aab2646
1447c658698a9
152450c63ad64
hex13357eceacd

1320030104269 has 2 divisors, whose sum is σ = 1320030104270. Its totient is φ = 1320030104268.

The previous prime is 1320030104227. The next prime is 1320030104353. The reversal of 1320030104269 is 9624010300231.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1092572648644 + 227457455625 = 1045262^2 + 476925^2 .

It is a cyclic number.

It is not a de Polignac number, because 1320030104269 - 215 = 1320030071501 is a prime.

It is a super-2 number, since 2×13200301042692 (a number of 25 digits) contains 22 as substring.

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

It is a congruent number.

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

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

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

Almost surely, 21320030104269 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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