Base | Representation |
---|---|
bin | 1010000110101100101110… |
… | …0001100100001001001101 |
3 | 1110100010100221101202121200 |
4 | 2201223023201210021031 |
5 | 2424012142200013401 |
6 | 35343542212020113 |
7 | 2224454053554345 |
oct | 241531341441115 |
9 | 43303327352550 |
10 | 11110200001101 |
11 | 35a389a292893 |
12 | 12b5293601639 |
13 | 6278c21a88b6 |
14 | 2a5a4513bd25 |
15 | 14400610b686 |
hex | a1acb86424d |
11110200001101 has 48 divisors (see below), whose sum is σ = 17128700384640. Its totient is φ = 6919616678400.
The previous prime is 11110200001097. The next prime is 11110200001123. The reversal of 11110200001101 is 10110000201111.
It is not a de Polignac number, because 11110200001101 - 22 = 11110200001097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110200001151) 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 47 ways as a sum of consecutive naturals, for example, 1967121 + ... + 5107833.
It is an arithmetic number, because the mean of its divisors is an integer number (356847924680).
Almost surely, 211110200001101 is an apocalyptic number.
It is an amenable number.
11110200001101 is a deficient number, since it is larger than the sum of its proper divisors (6018500383539).
11110200001101 is a wasteful number, since it uses less digits than its factorization.
11110200001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3141026 (or 3141023 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11110200001101 its reverse (10110000201111), we get a palindrome (21220200202212).
The spelling of 11110200001101 in words is "eleven trillion, one hundred ten billion, two hundred million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •