Base | Representation |
---|---|
bin | 110000000000001110110001… |
… | …110010000010111000001111 |
3 | 1000200112002001011012112221100 |
4 | 300000032301302002320033 |
5 | 210133011030112333403 |
6 | 2025004053122234143 |
7 | 62320032311433453 |
oct | 6000166162027017 |
9 | 1020462034175840 |
10 | 211122100121103 |
11 | 612a741a638456 |
12 | 1b818a641b5953 |
13 | 90a59619cb2b2 |
14 | 3a1c5153c0663 |
15 | 1961b84c8c2a3 |
hex | c003b1c82e0f |
211122100121103 has 48 divisors (see below), whose sum is σ = 309073182088320. Its totient is φ = 138854128089600.
The previous prime is 211122100121087. The next prime is 211122100121117. The reversal of 211122100121103 is 301121001221112.
It is a happy number.
It is not a de Polignac number, because 211122100121103 - 24 = 211122100121087 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211122100121143) 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 47 ways as a sum of consecutive naturals, for example, 7098673813 + ... + 7098703553.
It is an arithmetic number, because the mean of its divisors is an integer number (6439024626840).
Almost surely, 2211122100121103 is an apocalyptic number.
211122100121103 is a deficient number, since it is larger than the sum of its proper divisors (97951081967217).
211122100121103 is a wasteful number, since it uses less digits than its factorization.
211122100121103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49440 (or 49437 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 211122100121103 its reverse (301121001221112), we get a palindrome (512243101342215).
The spelling of 211122100121103 in words is "two hundred eleven trillion, one hundred twenty-two billion, one hundred million, one hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •