[go: up one dir, main page]

Search a number
-
+
13152011 is a prime number
BaseRepresentation
bin110010001010…
…111100001011
3220202012011112
4302022330023
511331331021
61145520535
7216535025
oct62127413
926665145
1013152011
117473334
1244a314b
132956472
141a65015
15124bd5b
hexc8af0b

13152011 has 2 divisors, whose sum is σ = 13152012. Its totient is φ = 13152010.

The previous prime is 13151989. The next prime is 13152019. The reversal of 13152011 is 11025131.

13152011 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 is a cyclic number.

It is not a de Polignac number, because 13152011 - 210 = 13150987 is a prime.

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

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

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

Almost surely, 213152011 is an apocalyptic number.

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

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

13152011 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 30, while the sum is 14.

The square root of 13152011 is about 3626.5701427106. The cubic root of 13152011 is about 236.0464035441.

Adding to 13152011 its reverse (11025131), we get a palindrome (24177142).

The spelling of 13152011 in words is "thirteen million, one hundred fifty-two thousand, eleven".