Search a number
-
+
11011101313 = 52321053731
BaseRepresentation
bin10100100000101000…
…00001001010000001
31001102101022220101011
422100110001022001
5140022320220223
65020342040521
7536602550122
oct122024011201
931371286334
1011011101313
114740530433
122173719141
131066313584
14766560049
15446a3380d
hex290501281

11011101313 has 4 divisors (see below), whose sum is σ = 11032155568. Its totient is φ = 10990047060.

The previous prime is 11011101307. The next prime is 11011101317. The reversal of 11011101313 is 31310111011.

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 a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11011101313 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 11011101293 and 11011101302.

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

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

Almost surely, 211011101313 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 21054254.

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

Adding to 11011101313 its reverse (31310111011), we get a palindrome (42321212324).

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

Divisors: 1 523 21053731 11011101313