Search a number
-
+
104550032150231 = 432431396096517
BaseRepresentation
bin10111110001011001110011…
…100001110000111011010111
3111201011212220111112111220112
4113301121303201300323113
5102200421431212301411
61010205342142353235
731010330155243163
oct2761316341607327
9451155814474815
10104550032150231
1130349468598228
12b8865b628b81b
1346450446a7a65
141bb636a073ca3
15c148bd9a3b8b
hex5f1673870ed7

104550032150231 has 4 divisors (see below), whose sum is σ = 106981428246792. Its totient is φ = 102118636053672.

The previous prime is 104550032150183. The next prime is 104550032150257. The reversal of 104550032150231 is 132051230055401.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-104550032150231 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (104550032150131) 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, 1215698048216 + ... + 1215698048301.

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

Almost surely, 2104550032150231 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2431396096560.

The product of its (nonzero) digits is 18000, while the sum is 32.

The spelling of 104550032150231 in words is "one hundred four trillion, five hundred fifty billion, thirty-two million, one hundred fifty thousand, two hundred thirty-one".

Divisors: 1 43 2431396096517 104550032150231