Search a number
-
+
11001050601 = 33667016867
BaseRepresentation
bin10100011111011011…
…01011010111101001
31001101200102021101120
422033231223113221
5140012232104401
65015342405453
7536421246552
oct121755532751
931350367346
1011001050601
114735896162
122170290889
1310642048c8
147650a5329
15445bea836
hex28fb6b5e9

11001050601 has 4 divisors (see below), whose sum is σ = 14668067472. Its totient is φ = 7334033732.

The previous prime is 11001050563. The next prime is 11001050603. The reversal of 11001050601 is 10605010011.

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 not a de Polignac number, because 11001050601 - 29 = 11001050089 is a prime.

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

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

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

Almost surely, 211001050601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3667016870.

The product of its (nonzero) digits is 30, while the sum is 15.

Adding to 11001050601 its reverse (10605010011), we get a palindrome (21606060612).

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

Divisors: 1 3 3667016867 11001050601