Base | Representation |
---|---|
bin | 1010001000000010000011… |
… | …0010000000101001010000 |
3 | 1110102022111020121000222111 |
4 | 2202000200302000221100 |
5 | 2424401044413240414 |
6 | 35402251122115104 |
7 | 2226224503624000 |
oct | 242004062005120 |
9 | 43368436530874 |
10 | 11133105211984 |
11 | 360258371a838 |
12 | 12b98064aba94 |
13 | 629b0272a012 |
14 | 2a6bb91d4000 |
15 | 1448e6e458c4 |
hex | a2020c80a50 |
11133105211984 has 40 divisors (see below), whose sum is σ = 25154975345600. Its totient is φ = 4771330802784.
The previous prime is 11133105211931. The next prime is 11133105211997. The reversal of 11133105211984 is 48911250133111.
It is a super-2 number, since 2×111331052119842 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1014308034 + ... + 1014319009.
It is an arithmetic number, because the mean of its divisors is an integer number (628874383640).
Almost surely, 211133105211984 is an apocalyptic number.
11133105211984 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11133105211984 is an abundant number, since it is smaller than the sum of its proper divisors (14021870133616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11133105211984 is an equidigital number, since it uses as much as digits as its factorization.
11133105211984 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2028627072 (or 2028627052 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 40.
The spelling of 11133105211984 in words is "eleven trillion, one hundred thirty-three billion, one hundred five million, two hundred eleven thousand, nine hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •