Search a number
-
+
13015301969 is a prime number
BaseRepresentation
bin11000001111100010…
…11011111101010001
31020121001120211211002
430013301123331101
5203123404130334
65551255031345
7640350145535
oct140761337521
936531524732
1013015301969
11557988700a
12263296b555
1312c55cb917
148b67cdbc5
15512975b7e
hex307c5bf51

13015301969 has 2 divisors, whose sum is σ = 13015301970. Its totient is φ = 13015301968.

The previous prime is 13015301953. The next prime is 13015301977. The reversal of 13015301969 is 96910351031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13001700625 + 13601344 = 114025^2 + 3688^2 .

It is a cyclic number.

It is not a de Polignac number, because 13015301969 - 24 = 13015301953 is a prime.

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

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

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

Almost surely, 213015301969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 21870, while the sum is 38.

The spelling of 13015301969 in words is "thirteen billion, fifteen million, three hundred one thousand, nine hundred sixty-nine".