Base | Representation |
---|---|
bin | 10100111000101110… |
… | …11100110110100000 |
3 | 1001221110212001221011 |
4 | 22130113130312200 |
5 | 140431102442101 |
6 | 5052404310304 |
7 | 544606466500 |
oct | 123427346640 |
9 | 31843761834 |
10 | 11213327776 |
11 | 48346a4142 |
12 | 220b3a2394 |
13 | 109919a0c1 |
14 | 785361a00 |
15 | 45967c751 |
hex | 29c5dcda0 |
11213327776 has 36 divisors (see below), whose sum is σ = 25680526578. Its totient is φ = 4805711232.
The previous prime is 11213327743. The next prime is 11213327791. The reversal of 11213327776 is 67772331211.
11213327776 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 10530864400 + 682463376 = 102620^2 + 26124^2 .
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 3574111 + ... + 3577246.
Almost surely, 211213327776 is an apocalyptic number.
11213327776 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
11213327776 is an abundant number, since it is smaller than the sum of its proper divisors (14467198802).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11213327776 is an equidigital number, since it uses as much as digits as its factorization.
11213327776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7151381 (or 7151366 counting only the distinct ones).
The product of its digits is 74088, while the sum is 40.
Adding to 11213327776 its reverse (67772331211), we get a palindrome (78985658987).
The spelling of 11213327776 in words is "eleven billion, two hundred thirteen million, three hundred twenty-seven thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •