Search a number
-
+
11011050001 = 74613412163
BaseRepresentation
bin10100100000100111…
…10100101000010001
31001102101020021222201
422100103310220101
5140022312100001
65020341003201
7536602244410
oct122023645021
931371207881
1011011050001
1147404a5926
1221736b3501
1310662c6103
14766549477
15446a23501
hex2904f4a11

11011050001 has 8 divisors (see below), whose sum is σ = 12611358144. Its totient is φ = 9417567120.

The previous prime is 11011049989. The next prime is 11011050019. The reversal of 11011050001 is 10005011011.

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

It is a cyclic number.

It is not a de Polignac number, because 11011050001 - 27 = 11011049873 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 211011050001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3412631.

The product of its (nonzero) digits is 5, while the sum is 10.

Adding to 11011050001 its reverse (10005011011), we get a palindrome (21016061012).

The spelling of 11011050001 in words is "eleven billion, eleven million, fifty thousand, one".

Divisors: 1 7 461 3227 3412163 23885141 1573007143 11011050001