Search a number
-
+
10011311013 = 311624748563
BaseRepresentation
bin10010101001011100…
…00111101110100101
3221211201001021220210
421110232013232211
5131000343423023
64333225050033
7503042511444
oct112456075645
927751037823
1010011311013
114278140160
121b34926919
13c3714a992
146ad868d5b
153d8d94593
hex254b87ba5

10011311013 has 16 divisors (see below), whose sum is σ = 14564537856. Its totient is φ = 6066365040.

The previous prime is 10011310987. The next prime is 10011311047. The reversal of 10011311013 is 31011311001.

It is not a de Polignac number, because 10011311013 - 210 = 10011309989 is a prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 10011311013.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 181870 + ... + 230432.

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

Almost surely, 210011311013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 54824.

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

Subtracting from 10011311013 its sum of digits (12), we obtain a palindrome (10011311001).

Adding to 10011311013 its reverse (31011311001), we get a palindrome (41022622014).

The spelling of 10011311013 in words is "ten billion, eleven million, three hundred eleven thousand, thirteen".

Divisors: 1 3 11 33 6247 18741 48563 68717 145689 206151 534193 1602579 303373061 910119183 3337103671 10011311013