Search a number
-
+
11115011452 = 2214271947269
BaseRepresentation
bin10100101101000000…
…11001110101111100
31001200121212002021211
422112200121311330
5140230420331302
65034533134204
7542304016126
oct122640316574
931617762254
1011115011452
114794152686
1221a248a364
1310819c5a6c
1477628c216
15450c0bad7
hex296819d7c

11115011452 has 12 divisors (see below), whose sum is σ = 19464910920. Its totient is φ = 5553608336.

The previous prime is 11115011449. The next prime is 11115011461. The reversal of 11115011452 is 25411051111.

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

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

It is a congruent number.

It is an unprimeable number.

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 in 3 ways as a sum of consecutive naturals, for example, 967927 + ... + 979342.

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

Almost surely, 211115011452 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 200, while the sum is 22.

Adding to 11115011452 its reverse (25411051111), we get a palindrome (36526062563).

The spelling of 11115011452 in words is "eleven billion, one hundred fifteen million, eleven thousand, four hundred fifty-two".

Divisors: 1 2 4 1427 2854 5708 1947269 3894538 7789076 2778752863 5557505726 11115011452