Base | Representation |
---|---|
bin | 1010001011111110111110… |
… | …1000110101100000001000 |
3 | 1110122210201221222210112200 |
4 | 2202333233220311200020 |
5 | 2432004122022401300 |
6 | 35453400215240200 |
7 | 2234150140534026 |
oct | 242775750654010 |
9 | 43583657883480 |
10 | 11201000200200 |
11 | 3629354670348 |
12 | 130a9b4379060 |
13 | 633332a20565 |
14 | 2aa1ba417716 |
15 | 14656c84e200 |
hex | a2fefa35808 |
11201000200200 has 144 divisors (see below), whose sum is σ = 38146505342400. Its totient is φ = 2944863868800.
The previous prime is 11201000200199. The next prime is 11201000200231. The reversal of 11201000200200 is 200200010211.
11201000200200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 43694580 + ... + 43950179.
It is an arithmetic number, because the mean of its divisors is an integer number (264906287100).
Almost surely, 211201000200200 is an apocalyptic number.
11201000200200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11201000200200 is an abundant number, since it is smaller than the sum of its proper divisors (26945505142200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11201000200200 is a wasteful number, since it uses less digits than its factorization.
11201000200200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87644852 (or 87644840 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 11201000200200 its reverse (200200010211), we get a palindrome (11401200210411).
The spelling of 11201000200200 in words is "eleven trillion, two hundred one billion, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •