Search a number
-
+
11514110061 = 327133142787
BaseRepresentation
bin10101011100100101…
…10110000001101101
31002201102211101122210
422232102312001231
5142040103010221
65142311201033
7555221214666
oct125622660155
932642741583
1011514110061
114979462343
122294076179
1311165acc9c
147b329a36d
15475c93276
hex2ae4b606d

11514110061 has 16 divisors (see below), whose sum is σ = 15455710208. Its totient is φ = 7624465200.

The previous prime is 11514110051. The next prime is 11514110093. The reversal of 11514110061 is 16001141511.

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

It is not a de Polignac number, because 11514110061 - 29 = 11514109549 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11514110021) 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 in 15 ways as a sum of consecutive naturals, for example, 247710 + ... + 290496.

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

Almost surely, 211514110061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 43392.

The product of its (nonzero) digits is 120, while the sum is 21.

Adding to 11514110061 its reverse (16001141511), we get a palindrome (27515251572).

The spelling of 11514110061 in words is "eleven billion, five hundred fourteen million, one hundred ten thousand, sixty-one".

Divisors: 1 3 271 331 813 993 42787 89701 128361 269103 11595277 14162497 34785831 42487491 3838036687 11514110061