Search a number
-
+
105001241151 = 3109321104713
BaseRepresentation
bin110000111001010001…
…1111100101000111111
3101001000201100201100110
41201302203330220333
53210020304204101
6120123101001103
710405012552332
oct1416243745077
9331021321313
10105001241151
1140592510654
1218424853193
139b949b4231
145121366619
152ae8338cd6
hex18728fca3f

105001241151 has 8 divisors (see below), whose sum is σ = 141286074160. Its totient is φ = 69358617792.

The previous prime is 105001241123. The next prime is 105001241221. The reversal of 105001241151 is 151142100501.

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

It is not a de Polignac number, because 105001241151 - 215 = 105001208383 is a prime.

It is a super-2 number, since 2×1050012411512 (a number of 23 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 (105001231151) 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, 160552030 + ... + 160552683.

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

Almost surely, 2105001241151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 321104825.

The product of its (nonzero) digits is 200, while the sum is 21.

Adding to 105001241151 its reverse (151142100501), we get a palindrome (256143341652).

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

Divisors: 1 3 109 327 321104713 963314139 35000413717 105001241151