Base | Representation |
---|---|
bin | 1010000110110100001011… |
… | …0111011011001010110010 |
3 | 1110100022112110221000212222 |
4 | 2201231002313123022302 |
5 | 2424030242232021320 |
6 | 35344513014321042 |
7 | 2224554505261010 |
oct | 241550267331262 |
9 | 43308473830788 |
10 | 11112202220210 |
11 | 35a4727505723 |
12 | 12b5752059182 |
13 | 627b50c4c030 |
14 | 2a5b950138b0 |
15 | 1440c1cab825 |
hex | a1b42ddb2b2 |
11112202220210 has 64 divisors (see below), whose sum is σ = 26065907868672. Its totient is φ = 3309956545536.
The previous prime is 11112202220209. The next prime is 11112202220237. The reversal of 11112202220210 is 1202220221111.
11112202220210 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 (17).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 359137802 + ... + 359168741.
It is an arithmetic number, because the mean of its divisors is an integer number (407279810448).
Almost surely, 211112202220210 is an apocalyptic number.
11112202220210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11112202220210 is an abundant number, since it is smaller than the sum of its proper divisors (14953705648462).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112202220210 is a wasteful number, since it uses less digits than its factorization.
11112202220210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 718306587.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11112202220210 its reverse (1202220221111), we get a palindrome (12314422441321).
The spelling of 11112202220210 in words is "eleven trillion, one hundred twelve billion, two hundred two million, two hundred twenty thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •