Base | Representation |
---|---|
bin | 1010001011111111110011… |
… | …0011100000011010010000 |
3 | 1110122211022100122201202012 |
4 | 2202333330303200122100 |
5 | 2432010100100214300 |
6 | 35453434150042052 |
7 | 2234155462262204 |
oct | 242777463403220 |
9 | 43584270581665 |
10 | 11201221101200 |
11 | 3629458329559 |
12 | 130aa56349328 |
13 | 633369715100 |
14 | 2aa1db8bab04 |
15 | 146581e36435 |
hex | a2ffcce0690 |
11201221101200 has 90 divisors (see below), whose sum is σ = 29140241988294. Its totient is φ = 4135835458560.
The previous prime is 11201221101193. The next prime is 11201221101211. The reversal of 11201221101200 is 210112210211.
11201221101200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 9 ways, for example, as 8533970319616 + 2667250781584 = 2921296^2 + 1633172^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 82781669 + ... + 82916868.
Almost surely, 211201221101200 is an apocalyptic number.
11201221101200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11201221101200 is an abundant number, since it is smaller than the sum of its proper divisors (17939020887094).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11201221101200 is a wasteful number, since it uses less digits than its factorization.
11201221101200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 165698581 (or 165698557 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11201221101200 its reverse (210112210211), we get a palindrome (11411333311411).
The spelling of 11201221101200 in words is "eleven trillion, two hundred one billion, two hundred twenty-one million, one hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •