Search a number
-
+
11442150561 = 323315349299
BaseRepresentation
bin10101010100000000…
…10101110010100001
31002112102102110210010
422222000111302201
5141413142304221
65131220555133
7553355450352
oct125200256241
932472373703
1011442150561
114941883086
122273b52aa9
1311047065ba
147a78c7d29
1546e7cbc76
hex2aa015ca1

11442150561 has 16 divisors (see below), whose sum is σ = 16433049600. Its totient is φ = 7061073360.

The previous prime is 11442150547. The next prime is 11442150583. The reversal of 11442150561 is 16505124411.

It is not a de Polignac number, because 11442150561 - 25 = 11442150529 is a prime.

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

It is a Curzon number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2672511 + ... + 2676788.

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

Almost surely, 211442150561 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5349356.

The product of its (nonzero) digits is 4800, while the sum is 30.

Adding to 11442150561 its reverse (16505124411), we get a palindrome (27947274972).

The spelling of 11442150561 in words is "eleven billion, four hundred forty-two million, one hundred fifty thousand, five hundred sixty-one".

Divisors: 1 3 23 31 69 93 713 2139 5349299 16047897 123033877 165828269 369101631 497484807 3814050187 11442150561