Base | Representation |
---|---|
bin | 1100010010110111010… |
… | …0010111100010001110 |
3 | 202012012102122102210211 |
4 | 3010231310113202032 |
5 | 11430040324200420 |
6 | 241011210353034 |
7 | 21155165141020 |
oct | 3045564274216 |
9 | 665172572724 |
10 | 211222100110 |
11 | 816404070aa |
12 | 34b29a2b77a |
13 | 16bc226b0b8 |
14 | a31a688010 |
15 | 5763785e5a |
hex | 312dd1788e |
211222100110 has 32 divisors (see below), whose sum is σ = 453405952512. Its totient is φ = 69270352800.
The previous prime is 211222100101. The next prime is 211222100113. The reversal of 211222100110 is 11001222112.
211222100110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2112221001102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211222100113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65595316 + ... + 65598535.
It is an arithmetic number, because the mean of its divisors is an integer number (14168936016).
Almost surely, 2211222100110 is an apocalyptic number.
211222100110 is an abundant number, since it is smaller than the sum of its proper divisors (242183852402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211222100110 is a wasteful number, since it uses less digits than its factorization.
211222100110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131193888.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 211222100110 its reverse (11001222112), we get a palindrome (222223322222).
The spelling of 211222100110 in words is "two hundred eleven billion, two hundred twenty-two million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •