Base | Representation |
---|---|
bin | 1010000110001010110110… |
… | …1110000000010001011000 |
3 | 1110022020220102222102100110 |
4 | 2201202231232000101120 |
5 | 2423340033130322333 |
6 | 35335440214004320 |
7 | 2224012566121365 |
oct | 241425556002130 |
9 | 43266812872313 |
10 | 11101110010968 |
11 | 359aa5521774a |
12 | 12b35773466a0 |
13 | 626aa3bab003 |
14 | 2a5421bbd46c |
15 | 143b730a6063 |
hex | a18adb80458 |
11101110010968 has 32 divisors (see below), whose sum is σ = 27796757276160. Its totient is φ = 3694505703840.
The previous prime is 11101110010967. The next prime is 11101110011009. The reversal of 11101110010968 is 86901001110111.
It is a happy number.
It is a super-2 number, since 2×111011100109682 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101110010967) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 366503280 + ... + 366533567.
It is an arithmetic number, because the mean of its divisors is an integer number (868648664880).
Almost surely, 211101110010968 is an apocalyptic number.
It is an amenable number.
11101110010968 is an abundant number, since it is smaller than the sum of its proper divisors (16695647265192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101110010968 is a wasteful number, since it uses less digits than its factorization.
11101110010968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 733037487 (or 733037483 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 30.
The spelling of 11101110010968 in words is "eleven trillion, one hundred one billion, one hundred ten million, ten thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •