Search a number
-
+
103550101 is a prime number
BaseRepresentation
bin1100010110000…
…00110010010101
321012211220000221
412023000302111
5203002100401
614135234341
72365106224
oct613006225
9235756027
10103550101
11534a67a6
122a8189b1
13185b7665
14da76cbb
1591567a1
hex62c0c95

103550101 has 2 divisors, whose sum is σ = 103550102. Its totient is φ = 103550100.

The previous prime is 103550099. The next prime is 103550107. The reversal of 103550101 is 101055301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 95082001 + 8468100 = 9751^2 + 2910^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 103550101 - 21 = 103550099 is a prime.

It is a super-3 number, since 3×1035501013 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

Together with 103550099, it forms a pair of twin primes.

It is a congruent number.

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

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

Almost surely, 2103550101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 75, while the sum is 16.

The square root of 103550101 is about 10175.9570065916. The cubic root of 103550101 is about 469.5878399653.

The spelling of 103550101 in words is "one hundred three million, five hundred fifty thousand, one hundred one".