Search a number
-
+
11014103536 = 24688381471
BaseRepresentation
bin10100100000111110…
…11110000111110000
31001102120222102122121
422100133132013300
5140024102303121
65020530244024
7536640223012
oct122037360760
931376872577
1011014103536
1147421a1007
122174726614
131066b24c37
14766b021b2
15446e28141
hex2907de1f0

11014103536 has 10 divisors (see below), whose sum is σ = 21339825632. Its totient is φ = 5507051760.

The previous prime is 11014103479. The next prime is 11014103537. The reversal of 11014103536 is 63530141011.

11014103536 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11014103537) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 344190720 + ... + 344190751.

Almost surely, 211014103536 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 1080, while the sum is 25.

Adding to 11014103536 its reverse (63530141011), we get a palindrome (74544244547).

The spelling of 11014103536 in words is "eleven billion, fourteen million, one hundred three thousand, five hundred thirty-six".

Divisors: 1 2 4 8 16 688381471 1376762942 2753525884 5507051768 11014103536