Search a number
-
+
103020504079 is a prime number
BaseRepresentation
bin101111111110010000…
…0000010010000001111
3100211220200020211220011
41133330200002100033
53141441222112304
6115154342534051
710304641556563
oct1377440022017
9324820224804
10103020504079
113a766430569
1217b71437327
13993a52296c
144db42836a3
152a2e4cdc04
hex17fc80240f

103020504079 has 2 divisors, whose sum is σ = 103020504080. Its totient is φ = 103020504078.

The previous prime is 103020504049. The next prime is 103020504109. The reversal of 103020504079 is 970405020301.

It is a balanced prime because it is at equal distance from previous prime (103020504049) and next prime (103020504109).

It is a cyclic number.

It is not a de Polignac number, because 103020504079 - 27 = 103020503951 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 2103020504079 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 7560, while the sum is 31.

The spelling of 103020504079 in words is "one hundred three billion, twenty million, five hundred four thousand, seventy-nine".