Search a number
-
+
11050506001 = 191095335831
BaseRepresentation
bin10100100101010100…
…10101011100010001
31001112010110212110001
422102222111130101
5140112412143001
65024310410001
7540561515443
oct122252253421
931463425401
1011050506001
1147607a4797
122184960901
13107152c162
1476b89a493
1544a219001
hex292a95711

11050506001 has 8 divisors (see below), whose sum is σ = 11738830400. Its totient is φ = 10372853520.

The previous prime is 11050505981. The next prime is 11050506007. The reversal of 11050506001 is 10060505011.

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 11050506001 - 25 = 11050505969 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (19).

It is a Duffinian number.

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

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

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

Almost surely, 211050506001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5335959.

The product of its (nonzero) digits is 150, while the sum is 19.

The spelling of 11050506001 in words is "eleven billion, fifty million, five hundred six thousand, one".

Divisors: 1 19 109 2071 5335831 101380789 581605579 11050506001