Search a number
-
+
13752721481 is a prime number
BaseRepresentation
bin11001100111011100…
…11110000001001001
31022111110011122012212
430303232132001021
5211131144041411
610152400314505
7664543126622
oct146356360111
938443148185
1013752721481
115918064224
1227b9912a35
1313b2310125
14946708a49
1555758a68b
hex333b9e049

13752721481 has 2 divisors, whose sum is σ = 13752721482. Its totient is φ = 13752721480.

The previous prime is 13752721439. The next prime is 13752721501. The reversal of 13752721481 is 18412725731.

13752721481 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12317448256 + 1435273225 = 110984^2 + 37885^2 .

It is a cyclic number.

It is not a de Polignac number, because 13752721481 - 218 = 13752459337 is a prime.

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

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

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

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

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

Almost surely, 213752721481 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 94080, while the sum is 41.

The spelling of 13752721481 in words is "thirteen billion, seven hundred fifty-two million, seven hundred twenty-one thousand, four hundred eighty-one".