Search a number
-
+
13283071369 is a prime number
BaseRepresentation
bin11000101111011101…
…11001010110001001
31021021201102221101021
430113232321112021
5204200431240434
610034022152441
7650111146411
oct142756712611
937251387337
1013283071369
1156a6a47137
1226a8582721
131338c23359
149001b3641
1552b219cb4
hex317bb9589

13283071369 has 2 divisors, whose sum is σ = 13283071370. Its totient is φ = 13283071368.

The previous prime is 13283071367. The next prime is 13283071387. The reversal of 13283071369 is 96317038231.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9032031369 + 4251040000 = 95037^2 + 65200^2 .

It is a cyclic number.

It is not a de Polignac number, because 13283071369 - 21 = 13283071367 is a prime.

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

Together with 13283071367, it forms a pair of twin primes.

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

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

Almost surely, 213283071369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 163296, while the sum is 43.

The spelling of 13283071369 in words is "thirteen billion, two hundred eighty-three million, seventy-one thousand, three hundred sixty-nine".