Base | Representation |
---|---|
bin | 1010000000110111111001… |
… | …0110111001011010100000 |
3 | 1102222120001021022101202210 |
4 | 2200031332112321122200 |
5 | 2420342212001024300 |
6 | 35225551350042120 |
7 | 2214312031205211 |
oct | 240157626713240 |
9 | 42876037271683 |
10 | 11010121111200 |
11 | 3565403374622 |
12 | 1299a03349340 |
13 | 61b333237153 |
14 | 2a0c6d823408 |
15 | 1415e9edc050 |
hex | a037e5b96a0 |
11010121111200 has 72 divisors (see below), whose sum is σ = 35837944224768. Its totient is φ = 2936032295680.
The previous prime is 11010121111193. The next prime is 11010121111229. The reversal of 11010121111200 is 211112101011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2293772832 + ... + 2293777631.
It is an arithmetic number, because the mean of its divisors is an integer number (497749225344).
Almost surely, 211010121111200 is an apocalyptic number.
11010121111200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11010121111200 is an abundant number, since it is smaller than the sum of its proper divisors (24827823113568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010121111200 is a wasteful number, since it uses less digits than its factorization.
11010121111200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4587550486 (or 4587550473 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11010121111200 its reverse (211112101011), we get a palindrome (11221233212211).
The spelling of 11010121111200 in words is "eleven trillion, ten billion, one hundred twenty-one million, one hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •