[go: up one dir, main page]

Search a number
-
+
10522013 is a prime number
BaseRepresentation
bin101000001000…
…110110011101
3201210120111012
4220020312131
510143201023
61013305005
7155302265
oct50106635
921716435
1010522013
115a37387
123635165
132245358
14157c7a5
15dcc978
hexa08d9d

10522013 has 2 divisors, whose sum is σ = 10522014. Its totient is φ = 10522012.

The previous prime is 10522007. The next prime is 10522027. The reversal of 10522013 is 31022501.

It is a happy number.

It is an a-pointer prime, because the next prime (10522027) can be obtained adding 10522013 to its sum of digits (14).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10510564 + 11449 = 3242^2 + 107^2 .

It is a cyclic number.

It is not a de Polignac number, because 10522013 - 28 = 10521757 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 210522013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 10522013 is about 3243.7652504458. The cubic root of 10522013 is about 219.1288761404.

Adding to 10522013 its reverse (31022501), we get a palindrome (41544514).

The spelling of 10522013 in words is "ten million, five hundred twenty-two thousand, thirteen".