Base | Representation |
---|---|
bin | 1010000000111011111010… |
… | …1010100100011101110101 |
3 | 1102222122211110110010211100 |
4 | 2200032332222210131311 |
5 | 2420401414200310401 |
6 | 35230250410400313 |
7 | 2214350541535104 |
oct | 240167652443565 |
9 | 42878743403740 |
10 | 11011200010101 |
11 | 3565907387305 |
12 | 129a064730099 |
13 | 61b47590a475 |
14 | 2a0d32c2c03b |
15 | 14165eaa5b86 |
hex | a03beaa4775 |
11011200010101 has 96 divisors (see below), whose sum is σ = 17618384010240. Its totient is φ = 6598043246592.
The previous prime is 11011200010099. The next prime is 11011200010133. The reversal of 11011200010101 is 10101000211011.
It is not a de Polignac number, because 11011200010101 - 21 = 11011200010099 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 (11011200010801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 65804820 + ... + 65971938.
It is an arithmetic number, because the mean of its divisors is an integer number (183524833440).
Almost surely, 211011200010101 is an apocalyptic number.
It is an amenable number.
11011200010101 is a deficient number, since it is larger than the sum of its proper divisors (6607184000139).
11011200010101 is a wasteful number, since it uses less digits than its factorization.
11011200010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167395 (or 167392 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11011200010101 its reverse (10101000211011), we get a palindrome (21112200221112).
The spelling of 11011200010101 in words is "eleven trillion, eleven billion, two hundred million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •