Base | Representation |
---|---|
bin | 1010000000010110000000… |
… | …0001010011100110010010 |
3 | 1102221200120011002211101110 |
4 | 2200011200001103212102 |
5 | 2420220043140401320 |
6 | 35221444432514150 |
7 | 2213540404556010 |
oct | 240054001234622 |
9 | 42850504084343 |
10 | 11001022200210 |
11 | 3561564266079 |
12 | 12980a40ab956 |
13 | 61a513134c53 |
14 | 2a06492218b0 |
15 | 1412662c35e0 |
hex | a0160053992 |
11001022200210 has 128 divisors (see below), whose sum is σ = 31004891933184. Its totient is φ = 2445364131840.
The previous prime is 11001022200209. The next prime is 11001022200271. The reversal of 11001022200210 is 1200222010011.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 15606990 + ... + 16296630.
It is an arithmetic number, because the mean of its divisors is an integer number (242225718228).
Almost surely, 211001022200210 is an apocalyptic number.
11001022200210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11001022200210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15502445966592).
11001022200210 is an abundant number, since it is smaller than the sum of its proper divisors (20003869732974).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001022200210 is a wasteful number, since it uses less digits than its factorization.
11001022200210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 691748.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11001022200210 its reverse (1200222010011), we get a palindrome (12201244210221).
The spelling of 11001022200210 in words is "eleven trillion, one billion, twenty-two million, two hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •