Base | Representation |
---|---|
bin | 1100010010011100110… |
… | …1011100011100101010 |
3 | 202011220201000211011111 |
4 | 3010213031130130222 |
5 | 11424323433431242 |
6 | 240552210220534 |
7 | 21152350606153 |
oct | 3044715343452 |
9 | 664821024144 |
10 | 211111233322 |
11 | 81593873260 |
12 | 34ab888474a |
13 | 16ba52c1352 |
14 | a309a6892a |
15 | 5758b86817 |
hex | 312735c72a |
211111233322 has 16 divisors (see below), whose sum is σ = 347208329952. Its totient is φ = 95472544720.
The previous prime is 211111233287. The next prime is 211111233337. The reversal of 211111233322 is 223332111112.
211111233322 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 (22).
It is a junction number, because it is equal to n+sod(n) for n = 211111233293 and 211111233302.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 24350908 + ... + 24359575.
It is an arithmetic number, because the mean of its divisors is an integer number (21700520622).
Almost surely, 2211111233322 is an apocalyptic number.
211111233322 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
211111233322 is a deficient number, since it is larger than the sum of its proper divisors (136097096630).
211111233322 is a wasteful number, since it uses less digits than its factorization.
211111233322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48710693.
The product of its digits is 432, while the sum is 22.
Adding to 211111233322 its reverse (223332111112), we get a palindrome (434443344434).
The spelling of 211111233322 in words is "two hundred eleven billion, one hundred eleven million, two hundred thirty-three thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •