Search a number
-
+
13069291051 is a prime number
BaseRepresentation
bin11000010101111110…
…11000111000101011
31020201211011202220201
430022333120320223
5203231214303201
610000504133031
7641604066235
oct141277307053
936654152821
1013069291051
1155a7301893
122648a67177
13130385291b
148bda45255
1551758c801
hex30afd8e2b

13069291051 has 2 divisors, whose sum is σ = 13069291052. Its totient is φ = 13069291050.

The previous prime is 13069291009. The next prime is 13069291057. The reversal of 13069291051 is 15019296031.

It is a happy number.

It is a strong prime.

It is an emirp because it is prime and its reverse (15019296031) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 13069291051 - 213 = 13069282859 is a prime.

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

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

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

Almost surely, 213069291051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 14580, while the sum is 37.

The spelling of 13069291051 in words is "thirteen billion, sixty-nine million, two hundred ninety-one thousand, fifty-one".