Search a number
-
+
103938282669 = 3135350284607
BaseRepresentation
bin110000011001100110…
…1000101010010101101
3100221021122012211102210
41200303031011102231
53200331200021134
6115425410041033
710336454553114
oct1406315052255
9327248184383
10103938282669
11400974a6171
1218188879179
139a55702610
14506010ac7b
152a84d6d2e9
hex18333454ad

103938282669 has 16 divisors (see below), whose sum is σ = 152060654592. Its totient is φ = 62755188288.

The previous prime is 103938282661. The next prime is 103938282671. The reversal of 103938282669 is 966282839301.

It is not a de Polignac number, because 103938282669 - 23 = 103938282661 is a prime.

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

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (103938282661) 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 in 15 ways as a sum of consecutive naturals, for example, 25140237 + ... + 25144370.

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

Almost surely, 2103938282669 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 50284676.

The product of its (nonzero) digits is 6718464, while the sum is 57.

The spelling of 103938282669 in words is "one hundred three billion, nine hundred thirty-eight million, two hundred eighty-two thousand, six hundred sixty-nine".

Divisors: 1 3 13 39 53 159 689 2067 50284607 150853821 653699891 1961099673 2665084171 7995252513 34646094223 103938282669