Search a number
-
+
100960051 = 109926239
BaseRepresentation
bin1100000010010…
…00011100110011
321000222022011011
412001020130303
5201321210201
614003531351
72334101113
oct601103463
9230868134
10100960051
1151a97865
1229989b57
1317bbb79a
14d5a1043
158ce4151
hex6048733

100960051 has 4 divisors (see below), whose sum is σ = 101886400. Its totient is φ = 100033704.

The previous prime is 100960039. The next prime is 100960061. The reversal of 100960051 is 150069001.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 100960051 - 25 = 100960019 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (100960021) 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 3 ways as a sum of consecutive naturals, for example, 463011 + ... + 463228.

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

Almost surely, 2100960051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 926348.

The product of its (nonzero) digits is 270, while the sum is 22.

The square root of 100960051 is about 10047.8878875115. The cubic root of 100960051 is about 465.6395423952.

The spelling of 100960051 in words is "one hundred million, nine hundred sixty thousand, fifty-one".

Divisors: 1 109 926239 100960051