Base | Representation |
---|---|
bin | 1010000100001101011011… |
… | …0101000111000001010110 |
3 | 1110012000222220220200220022 |
4 | 2201003112311013001112 |
5 | 2422312104120013420 |
6 | 35312151200505142 |
7 | 2221411323553343 |
oct | 241032665070126 |
9 | 43160886820808 |
10 | 11067440001110 |
11 | 3587747397a19 |
12 | 12a8b3b31b1b2 |
13 | 62386939295c |
14 | 2a394a19d7ca |
15 | 142d5218bc25 |
hex | a10d6d47056 |
11067440001110 has 16 divisors (see below), whose sum is σ = 20459808002736. Its totient is φ = 4307328000288.
The previous prime is 11067440001083. The next prime is 11067440001119. The reversal of 11067440001110 is 1110004476011.
It is a self number, because there is not a number n which added to its sum of digits gives 11067440001110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11067440001119) by changing a digit.
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 in 7 ways as a sum of consecutive naturals, for example, 14955999632 + ... + 14956000371.
It is an arithmetic number, because the mean of its divisors is an integer number (1278738000171).
Almost surely, 211067440001110 is an apocalyptic number.
11067440001110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11067440001110 is a deficient number, since it is larger than the sum of its proper divisors (9392368001626).
11067440001110 is a wasteful number, since it uses less digits than its factorization.
11067440001110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29912000047.
The product of its (nonzero) digits is 672, while the sum is 26.
Adding to 11067440001110 its reverse (1110004476011), we get a palindrome (12177444477121).
The spelling of 11067440001110 in words is "eleven trillion, sixty-seven billion, four hundred forty million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •