Search a number
-
+
13051299268753 is a prime number
BaseRepresentation
bin1011110111101011111000…
…0011101000100010010001
31201012200200111010101120021
42331322332003220202101
53202313030103100003
643431403433543441
72514632235240604
oct275727603504221
951180614111507
1013051299268753
114182030210679
121569519874b81
13738969968305
1433198712633b
151797631252bd
hexbdebe0e8891

13051299268753 has 2 divisors, whose sum is σ = 13051299268754. Its totient is φ = 13051299268752.

The previous prime is 13051299268741. The next prime is 13051299268807. The reversal of 13051299268753 is 35786299215031.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11960302306689 + 1090996962064 = 3458367^2 + 1044508^2 .

It is a cyclic number.

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

It is a junction number, because it is equal to n+sod(n) for n = 13051299268691 and 13051299268700.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 213051299268753 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24494400, while the sum is 61.

The spelling of 13051299268753 in words is "thirteen trillion, fifty-one billion, two hundred ninety-nine million, two hundred sixty-eight thousand, seven hundred fifty-three".