Search a number
-
+
102704832229 is a prime number
BaseRepresentation
bin101111110100110101…
…1110101111011100101
3100211002200021001112011
41133221223311323211
53140314414112404
6115103144554221
710264056445516
oct1375153657345
9324080231464
10102704832229
113a61422263a
1217aa3782971
1398b9cc879c
144d84390a0d
152a11926604
hex17e9af5ee5

102704832229 has 2 divisors, whose sum is σ = 102704832230. Its totient is φ = 102704832228.

The previous prime is 102704832199. The next prime is 102704832239. The reversal of 102704832229 is 922238407201.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 58184676225 + 44520156004 = 241215^2 + 210998^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 102704832229 - 29 = 102704831717 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 102704832191 and 102704832200.

It is a congruent number.

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

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

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

Almost surely, 2102704832229 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 96768, while the sum is 40.

The spelling of 102704832229 in words is "one hundred two billion, seven hundred four million, eight hundred thirty-two thousand, two hundred twenty-nine".