Base | Representation |
---|---|
bin | 110000000001100001100101… |
… | …110101001110100010101110 |
3 | 1000200211120120011000120221212 |
4 | 300001201211311032202232 |
5 | 210140440132132400420 |
6 | 2025113000404154422 |
7 | 62326330655562350 |
oct | 6001414565164256 |
9 | 1020746504016855 |
10 | 211211020200110 |
11 | 613310aa708957 |
12 | 1b83213b398a12 |
13 | 90b1162b7cc68 |
14 | 3a2294cac90d0 |
15 | 196413b3ec3c5 |
hex | c01865d4e8ae |
211211020200110 has 128 divisors (see below), whose sum is σ = 482616337674240. Its totient is φ = 64878463641600.
The previous prime is 211211020200107. The next prime is 211211020200119. The reversal of 211211020200110 is 11002020112112.
It is a super-2 number, since 2×2112110202001102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211211020200119) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 40650386 + ... + 45550805.
It is an arithmetic number, because the mean of its divisors is an integer number (3770440138080).
Almost surely, 2211211020200110 is an apocalyptic number.
211211020200110 is an abundant number, since it is smaller than the sum of its proper divisors (271405317474130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211211020200110 is a wasteful number, since it uses less digits than its factorization.
211211020200110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86201322.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 211211020200110 its reverse (11002020112112), we get a palindrome (222213040312222).
The spelling of 211211020200110 in words is "two hundred eleven trillion, two hundred eleven billion, twenty million, two hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •