Search a number
-
+
11075150642 = 246711857763
BaseRepresentation
bin10100101000010000…
…10110001100110010
31001120211211221112112
422110020112030302
5140140214310032
65030550525322
7541311140633
oct122410261462
931524757475
1011075150642
1147736a7666
122191066842
13107667a69a
14770c7388a
1544c4861b2
hex294216332

11075150642 has 8 divisors (see below), whose sum is σ = 16648300656. Its totient is φ = 5525717092.

The previous prime is 11075150629. The next prime is 11075150651. The reversal of 11075150642 is 24605157011.

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is an unprimeable number.

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

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

Almost surely, 211075150642 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11858232.

The product of its (nonzero) digits is 8400, while the sum is 32.

The spelling of 11075150642 in words is "eleven billion, seventy-five million, one hundred fifty thousand, six hundred forty-two".

Divisors: 1 2 467 934 11857763 23715526 5537575321 11075150642