Base | Representation |
---|---|
bin | 10100101000010000… |
… | …10110001100110010 |
3 | 1001120211211221112112 |
4 | 22110020112030302 |
5 | 140140214310032 |
6 | 5030550525322 |
7 | 541311140633 |
oct | 122410261462 |
9 | 31524757475 |
10 | 11075150642 |
11 | 47736a7666 |
12 | 2191066842 |
13 | 107667a69a |
14 | 770c7388a |
15 | 44c4861b2 |
hex | 294216332 |
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".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •