Search a number
-
+
103977341975 = 5213319930283
BaseRepresentation
bin110000011010110001…
…0000101010000010111
3100221101100201020201202
41200311202011100113
53200421144420400
6115433323143115
710340440552463
oct1406542052027
9327340636652
10103977341975
1140107553a91
1218199974a9b
139a60829c30
1450653974a3
152a884d64d5
hex1835885417

103977341975 has 12 divisors (see below), whose sum is σ = 138849743256. Its totient is φ = 76783267680.

The previous prime is 103977341969. The next prime is 103977341981. The reversal of 103977341975 is 579143779301.

It is an interprime number because it is at equal distance from previous prime (103977341969) and next prime (103977341981).

It is not a de Polignac number, because 103977341975 - 214 = 103977325591 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 159964817 + ... + 159965466.

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

Almost surely, 2103977341975 is an apocalyptic number.

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

103977341975 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 319930306 (or 319930301 counting only the distinct ones).

The product of its (nonzero) digits is 5000940, while the sum is 56.

The spelling of 103977341975 in words is "one hundred three billion, nine hundred seventy-seven million, three hundred forty-one thousand, nine hundred seventy-five".

Divisors: 1 5 13 25 65 325 319930283 1599651415 4159093679 7998257075 20795468395 103977341975