Base | Representation |
---|---|
bin | 10100101011111111… |
… | …01000101100011100 |
3 | 1001200000200200010122 |
4 | 22111333220230130 |
5 | 140221220442112 |
6 | 5034025054112 |
7 | 542141011463 |
oct | 122577505434 |
9 | 31600620118 |
10 | 11106421532 |
11 | 478a315978 |
12 | 219b627338 |
13 | 107cca8c7b |
14 | 7750939da |
15 | 4500b1872 |
hex | 295fe8b1c |
11106421532 has 6 divisors (see below), whose sum is σ = 19436237688. Its totient is φ = 5553210764.
The previous prime is 11106421523. The next prime is 11106421561. The reversal of 11106421532 is 23512460111.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1388302688 + ... + 1388302695.
It is an arithmetic number, because the mean of its divisors is an integer number (3239372948).
Almost surely, 211106421532 is an apocalyptic number.
It is an amenable number.
11106421532 is a deficient number, since it is larger than the sum of its proper divisors (8329816156).
11106421532 is a wasteful number, since it uses less digits than its factorization.
11106421532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2776605387 (or 2776605385 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 11106421532 its reverse (23512460111), we get a palindrome (34618881643).
The spelling of 11106421532 in words is "eleven billion, one hundred six million, four hundred twenty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •