Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …1010011110001000010001 |
3 | 1102221200202120200112222001 |
4 | 2200011210222132020101 |
5 | 2420220223111200423 |
6 | 35221500254314001 |
7 | 2213542341654304 |
oct | 240054452361021 |
9 | 42850676615861 |
10 | 11001100100113 |
11 | 35615a4232462 |
12 | 12981061b8901 |
13 | 61a52630b476 |
14 | 2a06556dcb3b |
15 | 14126d05ecad |
hex | a0164a9e211 |
11001100100113 has 32 divisors (see below), whose sum is σ = 11761502720000. Its totient is φ = 10259647961472.
The previous prime is 11001100100063. The next prime is 11001100100153. The reversal of 11001100100113 is 31100100110011.
It is a cyclic number.
It is not a de Polignac number, because 11001100100113 - 237 = 10863661146641 is a prime.
It is a super-2 number, since 2×110011001001132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11001100100113.
It is not an unprimeable number, because it can be changed into a prime (11001100100153) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1647114508 + ... + 1647121186.
It is an arithmetic number, because the mean of its divisors is an integer number (367546960000).
Almost surely, 211001100100113 is an apocalyptic number.
It is an amenable number.
11001100100113 is a deficient number, since it is larger than the sum of its proper divisors (760402619887).
11001100100113 is a wasteful number, since it uses less digits than its factorization.
11001100100113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9869.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 11001100100113 its reverse (31100100110011), we get a palindrome (42101200210124).
The spelling of 11001100100113 in words is "eleven trillion, one billion, one hundred million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •