Search a number
-
+
11011050601 = 195571040447
BaseRepresentation
bin10100100000100111…
…10100110001101001
31001102101020022210221
422100103310301221
5140022312104401
65020341010041
7536602246225
oct122023646151
931371208727
1011011050601
1147404a6321
1221736b3921
1310662c6475
14766549785
15446a237a1
hex2904f4c69

11011050601 has 8 divisors (see below), whose sum is σ = 11611399680. Its totient is φ = 10412783568.

The previous prime is 11011050599. The next prime is 11011050607. The reversal of 11011050601 is 10605011011.

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 11011050601 - 21 = 11011050599 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 211011050601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1041023.

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

Adding to 11011050601 its reverse (10605011011), we get a palindrome (21616061612).

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

Divisors: 1 19 557 10583 1040447 19768493 579528979 11011050601