Search a number
-
+
10158051 = 33386017
BaseRepresentation
bin100110101111…
…111111100011
3201010002020010
4212233333203
510100024201
61001420003
7152225211
oct46577743
921102203
1010158051
115808992
12349a603
1321487a7
1414c5cb1
15d59bd6
hex9affe3

10158051 has 4 divisors (see below), whose sum is σ = 13544072. Its totient is φ = 6772032.

The previous prime is 10158047. The next prime is 10158053. The reversal of 10158051 is 15085101.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15085101 = 35028367.

It is not a de Polignac number, because 10158051 - 22 = 10158047 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1693006 + ... + 1693011.

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

Almost surely, 210158051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3386020.

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

The square root of 10158051 is about 3187.1697475974. The cubic root of 10158051 is about 216.5725763715.

The spelling of 10158051 in words is "ten million, one hundred fifty-eight thousand, fifty-one".

Divisors: 1 3 3386017 10158051