Search a number
-
+
11011111032 = 233458796293
BaseRepresentation
bin10100100000101000…
…00011100001111000
31001102101100101201010
422100110003201320
5140022321023112
65020342153520
7536602620345
oct122024034170
931371311633
1011011111032
114740537769
1221737228a0
131066317b1c
147665637cc
15446a3663c
hex290503878

11011111032 has 16 divisors (see below), whose sum is σ = 27527777640. Its totient is φ = 3670370336.

The previous prime is 11011111031. The next prime is 11011111039. The reversal of 11011111032 is 23011111011.

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

It is a junction number, because it is equal to n+sod(n) for n = 11011110999 and 11011111017.

It is a congruent number.

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

Almost surely, 211011111032 is an apocalyptic number.

11011111032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.

It is an amenable number.

11011111032 is an abundant number, since it is smaller than the sum of its proper divisors (16516666608).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

11011111032 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 458796302 (or 458796298 counting only the distinct ones).

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

Adding to 11011111032 its reverse (23011111011), we get a palindrome (34022222043).

The spelling of 11011111032 in words is "eleven billion, eleven million, one hundred eleven thousand, thirty-two".

Divisors: 1 2 3 4 6 8 12 24 458796293 917592586 1376388879 1835185172 2752777758 3670370344 5505555516 11011111032