Search a number
-
+
102704832233 = 190015405233
BaseRepresentation
bin101111110100110101…
…1110101111011101001
3100211002200021001112022
41133221223311323221
53140314414112413
6115103144554225
710264056445523
oct1375153657351
9324080231468
10102704832233
113a614222643
1217aa3782975
1398b9cc87a3
144d84390a13
152a11926608
hex17e9af5ee9

102704832233 has 4 divisors (see below), whose sum is σ = 102710256468. Its totient is φ = 102699408000.

The previous prime is 102704832229. The next prime is 102704832239. The reversal of 102704832233 is 332238407201.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 37451151529 + 65253680704 = 193523^2 + 255448^2 .

It is a cyclic number.

It is not a de Polignac number, because 102704832233 - 22 = 102704832229 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (102704832239) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2683616 + ... + 2721617.

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

Almost surely, 2102704832233 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5424234.

The product of its (nonzero) digits is 48384, while the sum is 35.

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

Divisors: 1 19001 5405233 102704832233