Base | Representation |
---|---|
bin | 11110111000010111101… |
… | …000011100000111010111 |
3 | 21111212112111221212210200 |
4 | 132320113220130013113 |
5 | 234232040220233421 |
6 | 4302514540551543 |
7 | 306213605052114 |
oct | 36702750340727 |
9 | 7455474855720 |
10 | 2122110321111 |
11 | 748a88a53440 |
12 | 2a33425525b3 |
13 | 125163a11351 |
14 | 749d41ab90b |
15 | 3a303388726 |
hex | 1ee17a1c1d7 |
2122110321111 has 24 divisors (see below), whose sum is σ = 3434307945744. Its totient is φ = 1251367263360.
The previous prime is 2122110321029. The next prime is 2122110321139. The reversal of 2122110321111 is 1111230112212.
It is a happy number.
2122110321111 is a `hidden beast` number, since 2 + 1 + 221 + 10 + 321 + 111 = 666.
It is not a de Polignac number, because 2122110321111 - 215 = 2122110288343 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2122110320111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 289664686 + ... + 289672011.
It is an arithmetic number, because the mean of its divisors is an integer number (143096164406).
Almost surely, 22122110321111 is an apocalyptic number.
2122110321111 is a deficient number, since it is larger than the sum of its proper divisors (1312197624633).
2122110321111 is a wasteful number, since it uses less digits than its factorization.
2122110321111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 579336751 (or 579336748 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 2122110321111 its reverse (1111230112212), we get a palindrome (3233340433323).
The spelling of 2122110321111 in words is "two trillion, one hundred twenty-two billion, one hundred ten million, three hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •