Search a number
-
+
103253561 is a prime number
BaseRepresentation
bin1100010011110…
…00011000111001
321012021211020222
412021320120321
5202413103221
614125025425
72362432535
oct611703071
9235254228
10103253561
1153313a24
122a6b5275
13185126a8
14d9dabc5
1590e89ab
hex6278639

103253561 has 2 divisors, whose sum is σ = 103253562. Its totient is φ = 103253560.

The previous prime is 103253551. The next prime is 103253567. The reversal of 103253561 is 165352301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 97397161 + 5856400 = 9869^2 + 2420^2 .

It is an emirp because it is prime and its reverse (165352301) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 103253561 - 214 = 103237177 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 103253561.

It is not a weakly prime, because it can be changed into another prime (103253567) 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, 51626780 + 51626781.

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

Almost surely, 2103253561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2700, while the sum is 26.

The square root of 103253561 is about 10161.3759402947. The cubic root of 103253561 is about 469.1391530813.

The spelling of 103253561 in words is "one hundred three million, two hundred fifty-three thousand, five hundred sixty-one".