Search a number
-
+
104042406151 = 3753415712763
BaseRepresentation
bin110000011100101101…
…0010010000100000111
3100221112220010212000001
41200321122102010013
53201034323444101
6115444005502131
710342160601115
oct1407132220407
9327486125001
10104042406151
1140140253732
12181b7711947
139a7115ac48
14506dc92ab5
152a8e089901
hex1839692107

104042406151 has 16 divisors (see below), whose sum is σ = 108905205024. Its totient is φ = 99288768384.

The previous prime is 104042406131. The next prime is 104042406161. The reversal of 104042406151 is 151604240401.

It is a cyclic number.

It is not a de Polignac number, because 104042406151 - 213 = 104042397959 is a prime.

It is a super-3 number, since 3×1040424061513 (a number of 34 digits) contains 333 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 (104042406131) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8145496 + ... + 8158258.

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

Almost surely, 2104042406151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 17010.

The product of its (nonzero) digits is 3840, while the sum is 28.

Adding to 104042406151 its reverse (151604240401), we get a palindrome (255646646552).

The spelling of 104042406151 in words is "one hundred four billion, forty-two million, four hundred six thousand, one hundred fifty-one".

Divisors: 1 37 53 1961 4157 12763 153809 220321 472231 676439 8151877 25028243 53055791 1963064267 2811956923 104042406151