Search a number
-
+
10015051 = 23435437
BaseRepresentation
bin100110001101…
…000101001011
3200211211001211
4212031011023
510030440201
6554353551
7151061254
oct46150513
920754054
1010015051
115720502
12342b8b7
1320c8687
141489b2b
15d2c651
hex98d14b

10015051 has 4 divisors (see below), whose sum is σ = 10450512. Its totient is φ = 9579592.

The previous prime is 10015043. The next prime is 10015069. The reversal of 10015051 is 15051001.

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

It is not a de Polignac number, because 10015051 - 23 = 10015043 is a prime.

It is a pancake number, because a pancake can be divided into 10015051 parts by 4475 straight cuts.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10015351) 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, 217696 + ... + 217741.

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

Almost surely, 210015051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 435460.

The product of its (nonzero) digits is 25, while the sum is 13.

The square root of 10015051 is about 3164.6565374460. The cubic root of 10015051 is about 215.5515028091.

Adding to 10015051 its reverse (15051001), we get a palindrome (25066052).

It can be divided in two parts, 100 and 15051, that added together give a palindrome (15151).

The spelling of 10015051 in words is "ten million, fifteen thousand, fifty-one".

Divisors: 1 23 435437 10015051