Search a number
-
+
103405215569 is a prime number
BaseRepresentation
bin110000001001101101…
…1100101111101010001
3100212220111011012211212
41200103123211331101
53143233213344234
6115300444345505
710320322554455
oct1402333457521
9325814135755
10103405215569
113a943603a47
121805a245295
13999c1404b6
14500d3c8665
152a531725ce
hex18136e5f51

103405215569 has 2 divisors, whose sum is σ = 103405215570. Its totient is φ = 103405215568.

The previous prime is 103405215547. The next prime is 103405215629. The reversal of 103405215569 is 965512504301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 58231963969 + 45173251600 = 241313^2 + 212540^2 .

It is a cyclic number.

It is not a de Polignac number, because 103405215569 - 220 = 103404166993 is a prime.

It is a super-2 number, since 2×1034052155692 (a number of 23 digits) contains 22 as substring.

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

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

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

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

Almost surely, 2103405215569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 162000, while the sum is 41.

The spelling of 103405215569 in words is "one hundred three billion, four hundred five million, two hundred fifteen thousand, five hundred sixty-nine".