Base | Representation |
---|---|
bin | 1010000110001010011100… |
… | …1110001111011100010000 |
3 | 1110022020121211220011111101 |
4 | 2201202213032033130100 |
5 | 2423334322230134300 |
6 | 35335421321554144 |
7 | 2224010103535066 |
oct | 241424716173420 |
9 | 43266554804441 |
10 | 11101001021200 |
11 | 359a9a9746062 |
12 | 12b3546945954 |
13 | 626a8743a71c |
14 | 2a541152c036 |
15 | 143b68727b6a |
hex | a18a738f710 |
11101001021200 has 60 divisors (see below), whose sum is σ = 26934215991588. Its totient is φ = 4396436032000.
The previous prime is 11101001021137. The next prime is 11101001021203. The reversal of 11101001021200 is 212010010111.
It can be written as a sum of positive squares in 6 ways, for example, as 23313625344 + 11077687395856 = 152688^2 + 3328316^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (11101001021203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 137348227 + ... + 137429026.
Almost surely, 211101001021200 is an apocalyptic number.
11101001021200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11101001021200 is an abundant number, since it is smaller than the sum of its proper divisors (15833214970388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11101001021200 is a wasteful number, since it uses less digits than its factorization.
11101001021200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 274777372 (or 274777361 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11101001021200 its reverse (212010010111), we get a palindrome (11313011031311).
The spelling of 11101001021200 in words is "eleven trillion, one hundred one billion, one million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •