Search a number
-
+
11001101123 = 431049243889
BaseRepresentation
bin10100011111011011…
…10111101101000011
31001101200111211200202
422033231313231003
5140012240213443
65015343435415
7536421550055
oct121755675503
931350454622
1011001101123
114735920111
1221702b5b6b
1310642218bc
147650b98d5
15445c0a7b8
hex28fb77b43

11001101123 has 8 divisors (see below), whose sum is σ = 11267718000. Its totient is φ = 10734974208.

The previous prime is 11001101071. The next prime is 11001101131. The reversal of 11001101123 is 32110110011.

It is a happy number.

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 11001101123 - 212 = 11001097027 is a prime.

It is a super-2 number, since 2×110011011232 (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 (11001101143) 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, 76838 + ... + 167051.

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

Almost surely, 211001101123 is an apocalyptic number.

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

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

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

The sum of its prime factors is 244981.

The product of its (nonzero) digits is 6, while the sum is 11.

Adding to 11001101123 its reverse (32110110011), we get a palindrome (43111211134).

The spelling of 11001101123 in words is "eleven billion, one million, one hundred one thousand, one hundred twenty-three".

Divisors: 1 43 1049 45107 243889 10487227 255839561 11001101123