Base | Representation |
---|---|
bin | 1100010010110111000… |
… | …1000000111011101110 |
3 | 202012012100222210000222 |
4 | 3010231301000323232 |
5 | 11430040113033402 |
6 | 241011135451342 |
7 | 21155154520223 |
oct | 3045561007356 |
9 | 665170883028 |
10 | 211221221102 |
11 | 8163a966751 |
12 | 34b29686b52 |
13 | 16bc2020c88 |
14 | a31a4d994a |
15 | 57636607a2 |
hex | 312dc40eee |
211221221102 has 4 divisors (see below), whose sum is σ = 316831831656. Its totient is φ = 105610610550.
The previous prime is 211221221089. The next prime is 211221221129. The reversal of 211221221102 is 201122122112.
211221221102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×2112212211022 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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 as a sum of consecutive naturals, namely, 52805305274 + ... + 52805305277.
It is an arithmetic number, because the mean of its divisors is an integer number (79207957914).
Almost surely, 2211221221102 is an apocalyptic number.
211221221102 is a deficient number, since it is larger than the sum of its proper divisors (105610610554).
211221221102 is a wasteful number, since it uses less digits than its factorization.
211221221102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105610610553.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 211221221102 its reverse (201122122112), we get a palindrome (412343343214).
It can be divided in two parts, 21122122110 and 2, that added together give a palindrome (21122122112).
The spelling of 211221221102 in words is "two hundred eleven billion, two hundred twenty-one million, two hundred twenty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •