Search a number
-
+
13506481 is a prime number
BaseRepresentation
bin110011100001…
…011110110001
3221102012102001
4303201132301
511424201411
61201254001
7222542332
oct63413661
927365361
1013506481
11769568a
124634301
132a4b901
141b18289
1512bbdc1
hexce17b1

13506481 has 2 divisors, whose sum is σ = 13506482. Its totient is φ = 13506480.

The previous prime is 13506439. The next prime is 13506509. The reversal of 13506481 is 18460531.

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

It is an a-pointer prime, because the next prime (13506509) can be obtained adding 13506481 to its sum of digits (28).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13359025 + 147456 = 3655^2 + 384^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×135064812 = 364850058006722, which contains 22 as substring.

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

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

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

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

Almost surely, 213506481 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2880, while the sum is 28.

The square root of 13506481 is about 3675.1164607397. The cubic root of 13506481 is about 238.1482552039.

The spelling of 13506481 in words is "thirteen million, five hundred six thousand, four hundred eighty-one".