Search a number
-
+
10991100001 = 71570157143
BaseRepresentation
bin10100011110001111…
…01110000001100001
31001100222200201201211
422033013232001201
5140002210200001
65014345230121
7536240544220
oct121707560141
931328621654
1010991100001
11473020a122
122168a92341
13106212c68b
14763a34cb7
15444dd2351
hex28f1ee061

10991100001 has 4 divisors (see below), whose sum is σ = 12561257152. Its totient is φ = 9420942852.

The previous prime is 10991099989. The next prime is 10991100007. The reversal of 10991100001 is 10000119901.

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, and also an emirpimes, since its reverse is a distinct semiprime: 10000119901 = 22344843587.

It is a cyclic number.

It is not a de Polignac number, because 10991100001 - 215 = 10991067233 is a prime.

It is a Duffinian number.

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

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

Almost surely, 210991100001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1570157150.

The product of its (nonzero) digits is 81, while the sum is 22.

Adding to 10991100001 its reverse (10000119901), we get a palindrome (20991219902).

The spelling of 10991100001 in words is "ten billion, nine hundred ninety-one million, one hundred thousand, one".

Divisors: 1 7 1570157143 10991100001