Base | Representation |
---|---|
bin | 1010000000110111111001… |
… | …0010101100110111000000 |
3 | 1102222120001012020111212001 |
4 | 2200031332102230313000 |
5 | 2420342211210324300 |
6 | 35225551310313344 |
7 | 2214312015644212 |
oct | 240157622546700 |
9 | 42876035214761 |
10 | 11010120011200 |
11 | 3565402793132 |
12 | 1299a02ab8854 |
13 | 61b332c4056b |
14 | 2a0c6d6185b2 |
15 | 1415e9d7116a |
hex | a037e4acdc0 |
11010120011200 has 84 divisors (see below), whose sum is σ = 27092763987592. Its totient is φ = 4403887488000.
The previous prime is 11010120011179. The next prime is 11010120011203. The reversal of 11010120011200 is 211002101011.
It is a super-2 number, since 2×110101200112002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010120011203) 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, 50061475 + ... + 50280925.
Almost surely, 211010120011200 is an apocalyptic number.
11010120011200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11010120011200 is an abundant number, since it is smaller than the sum of its proper divisors (16082643976392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010120011200 is a wasteful number, since it uses less digits than its factorization.
11010120011200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 250830 (or 250815 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11010120011200 its reverse (211002101011), we get a palindrome (11221122112211).
The spelling of 11010120011200 in words is "eleven trillion, ten billion, one hundred twenty million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •