Base | Representation |
---|---|
bin | 1100010010011101000… |
… | …1001010111100100011 |
3 | 202011220202212110012120 |
4 | 3010213101022330203 |
5 | 11424324211211321 |
6 | 240552243155323 |
7 | 21152362115220 |
oct | 3044721127443 |
9 | 664822773176 |
10 | 211112210211 |
11 | 81594380201 |
12 | 34ab9075b43 |
13 | 16ba5573ba6 |
14 | a309c40947 |
15 | 5758ccaec6 |
hex | 312744af23 |
211112210211 has 32 divisors (see below), whose sum is σ = 323773905408. Its totient is φ = 119858365440.
The previous prime is 211112210167. The next prime is 211112210233. The reversal of 211112210211 is 112012211112.
It is a happy number.
It is not a de Polignac number, because 211112210211 - 29 = 211112209699 is a prime.
It is not an unprimeable number, because it can be changed into a prime (211112210251) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2001996 + ... + 2104806.
It is an arithmetic number, because the mean of its divisors is an integer number (10117934544).
Almost surely, 2211112210211 is an apocalyptic number.
211112210211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
211112210211 is a deficient number, since it is larger than the sum of its proper divisors (112661695197).
211112210211 is a wasteful number, since it uses less digits than its factorization.
211112210211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103451.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 211112210211 its reverse (112012211112), we get a palindrome (323124421323).
Subtracting from 211112210211 its reverse (112012211112), we obtain a palindrome (99099999099).
It can be divided in two parts, 21111 and 2210211, that added together give a palindrome (2231322).
The spelling of 211112210211 in words is "two hundred eleven billion, one hundred twelve million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •