Search a number
-
+
105006251 = 740936677
BaseRepresentation
bin1100100001001…
…00010010101011
321022120212111102
412100210102223
5203340200001
614230352015
72413352450
oct620442253
9238525442
10105006251
1154300829
122b1bb60b
13189a739c
14dd35827
159342e6b
hex64244ab

105006251 has 8 divisors (see below), whose sum is σ = 120303840. Its totient is φ = 89782848.

The previous prime is 105006227. The next prime is 105006257. The reversal of 105006251 is 152600501.

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

It is a cyclic number.

It is not a de Polignac number, because 105006251 - 210 = 105005227 is a prime.

It is a super-2 number, since 2×1050062512 = 22052625498150002, which contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (105006257) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

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

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

Almost surely, 2105006251 is an apocalyptic number.

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

105006251 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 37093.

The product of its (nonzero) digits is 300, while the sum is 20.

The square root of 105006251 is about 10247.2557789879. The cubic root of 105006251 is about 471.7787598475.

Adding to 105006251 its reverse (152600501), we get a palindrome (257606752).

The spelling of 105006251 in words is "one hundred five million, six thousand, two hundred fifty-one".

Divisors: 1 7 409 2863 36677 256739 15000893 105006251