Search a number
-
+
10051113 = 33350371
BaseRepresentation
bin100110010101…
…111000101001
3200220122112110
4212111320221
510033113423
6555232533
7151301352
oct46257051
920818473
1010051113
115745606
123448749
13210bc07
141498d29
15d38193
hex995e29

10051113 has 4 divisors (see below), whose sum is σ = 13401488. Its totient is φ = 6700740.

The previous prime is 10051073. The next prime is 10051117. The reversal of 10051113 is 31115001.

10051113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 10051113 - 217 = 9920041 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

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

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

Almost surely, 210051113 is an apocalyptic number.

It is an amenable number.

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

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

10051113 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 3350374.

The product of its (nonzero) digits is 15, while the sum is 12.

The square root of 10051113 is about 3170.3490344125. The cubic root of 10051113 is about 215.8099107803.

Adding to 10051113 its reverse (31115001), we get a palindrome (41166114).

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

Divisors: 1 3 3350371 10051113