Search a number
-
+
501141065151 = 31511106271667
BaseRepresentation
bin1110100101011100101…
…01011100110110111111
31202220112101022211100210
413102232111130312333
531202314103041101
61022115424123503
751130512525036
oct7225625346677
91686471284323
10501141065151
11183595080651
128115b166593
133834667905c
141a3809b171d
15d080dcb7d6
hex74ae55cdbf

501141065151 has 8 divisors (see below), whose sum is σ = 672613174144. Its totient is φ = 331881499800.

The previous prime is 501141065137. The next prime is 501141065177. The reversal of 501141065151 is 151560141105.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 501141065151 - 25 = 501141065119 is a prime.

It is a super-2 number, since 2×5011410651512 (a number of 24 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 (501141065351) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 553135381 + ... + 553136286.

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

Almost surely, 2501141065151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1106271821.

The product of its (nonzero) digits is 3000, while the sum is 30.

The spelling of 501141065151 in words is "five hundred one billion, one hundred forty-one million, sixty-five thousand, one hundred fifty-one".

Divisors: 1 3 151 453 1106271667 3318815001 167047021717 501141065151