Base | Representation |
---|---|
bin | 101111111110110000101111… |
… | …000001011101111101101110 |
3 | 1000200011102101211020122110122 |
4 | 233332300233001131331232 |
5 | 210124332224224213402 |
6 | 2024445433141004542 |
7 | 62306526060430625 |
oct | 5776605701357556 |
9 | 1020142354218418 |
10 | 211021122101102 |
11 | 61268612131465 |
12 | 1b8013829b3752 |
13 | 909928b6a90c1 |
14 | 3a176964d46bc |
15 | 195e224c63ca2 |
hex | bfec2f05df6e |
211021122101102 has 4 divisors (see below), whose sum is σ = 316531683151656. Its totient is φ = 105510561050550.
The previous prime is 211021122101039. The next prime is 211021122101107. The reversal of 211021122101102 is 201101221120112.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×2110211221011022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211021122101107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52755280525274 + ... + 52755280525277.
It is an arithmetic number, because the mean of its divisors is an integer number (79132920787914).
Almost surely, 2211021122101102 is an apocalyptic number.
211021122101102 is a deficient number, since it is larger than the sum of its proper divisors (105510561050554).
211021122101102 is a wasteful number, since it uses less digits than its factorization.
211021122101102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105510561050553.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 211021122101102 its reverse (201101221120112), we get a palindrome (412122343221214).
The spelling of 211021122101102 in words is "two hundred eleven trillion, twenty-one billion, one hundred twenty-two million, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •