Search a number
-
+
10051100013 = 313999239329
BaseRepresentation
bin10010101110001011…
…11001110101101101
3221221110220210011110
421113011321311231
5131041040200023
64341205542233
7504034640403
oct112705716555
927843823143
1010051100013
114298647229
121b46114979
13c4246c476
146b4c65473
153dc603a93
hex257179d6d

10051100013 has 8 divisors (see below), whose sum is σ = 13402480000. Its totient is φ = 6700226688.

The previous prime is 10051100011. The next prime is 10051100029. The reversal of 10051100013 is 31000115001.

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

It is not a de Polignac number, because 10051100013 - 21 = 10051100011 is a prime.

It is a super-2 number, since 2×100511000132 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 210051100013 is an apocalyptic number.

It is an amenable number.

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

10051100013 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 253331.

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

Adding to 10051100013 its reverse (31000115001), we get a palindrome (41051215014).

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

Divisors: 1 3 13999 41997 239329 717987 3350366671 10051100013