Base | Representation |
---|---|
bin | 1010000000010110110110… |
… | …0111000110010010111000 |
3 | 1102221201011001010222101112 |
4 | 2200011231213012102320 |
5 | 2420221030023223000 |
6 | 35221523215535452 |
7 | 2213546143615340 |
oct | 240055547062270 |
9 | 42851131128345 |
10 | 11001250211000 |
11 | 3561670a3aa45 |
12 | 129814852a588 |
13 | 61a54b44898a |
14 | 2a066b615d20 |
15 | 14127b312235 |
hex | a016d9c64b8 |
11001250211000 has 128 divisors (see below), whose sum is σ = 30968933299200. Its totient is φ = 3573338371200.
The previous prime is 11001250210939. The next prime is 11001250211027. The reversal of 11001250211000 is 11205210011.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 41225084 + ... + 41491083.
It is an arithmetic number, because the mean of its divisors is an integer number (241944791400).
Almost surely, 211001250211000 is an apocalyptic number.
11001250211000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11001250211000 is an abundant number, since it is smaller than the sum of its proper divisors (19967683088200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001250211000 is a wasteful number, since it uses less digits than its factorization.
11001250211000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82716214 (or 82716200 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 14.
Adding to 11001250211000 its reverse (11205210011), we get a palindrome (11012455421011).
The spelling of 11001250211000 in words is "eleven trillion, one billion, two hundred fifty million, two hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •