Search a number
-
+
13033021013 is a prime number
BaseRepresentation
bin11000010001101010…
…00001111001010101
31020122021221001202222
430020311001321111
5203142423133023
65553130512125
7640653564545
oct141065017125
936567831688
1013033021013
115588889651
122638895645
1312c9193a6c
148b8cc3325
155142c5cc8
hex308d41e55

13033021013 has 2 divisors, whose sum is σ = 13033021014. Its totient is φ = 13033021012.

The previous prime is 13033021003. The next prime is 13033021031. The reversal of 13033021013 is 31012033031.

Together with next prime (13033021031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11500846564 + 1532174449 = 107242^2 + 39143^2 .

It is a cyclic number.

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

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 = 13033020982 and 13033021000.

It is a congruent number.

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

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

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

Almost surely, 213033021013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 162, while the sum is 17.

Adding to 13033021013 its reverse (31012033031), we get a palindrome (44045054044).

The spelling of 13033021013 in words is "thirteen billion, thirty-three million, twenty-one thousand, thirteen".