Base | Representation |
---|---|
bin | 101111110001101011101001… |
… | …110001001001011110011111 |
3 | 1000112222111102012112012222002 |
4 | 233301223221301021132133 |
5 | 210020120443334430421 |
6 | 2022520505121512515 |
7 | 62154556526042105 |
oct | 5761535161113637 |
9 | 1015874365465862 |
10 | 210122312030111 |
11 | 60a51410299978 |
12 | 1b6971411a273b |
13 | 90325ab5c9500 |
14 | 39c5d8d179c75 |
15 | 1945b6be33b0b |
hex | bf1ae9c4979f |
210122312030111 has 24 divisors (see below), whose sum is σ = 228338634030624. Its totient is φ = 193269466091520.
The previous prime is 210122312030089. The next prime is 210122312030159. The reversal of 210122312030111 is 111030213221012.
It is a de Polignac number, because none of the positive numbers 2k-210122312030111 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210122312080111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 95562206 + ... + 97736276.
It is an arithmetic number, because the mean of its divisors is an integer number (9514109751276).
Almost surely, 2210122312030111 is an apocalyptic number.
210122312030111 is a deficient number, since it is larger than the sum of its proper divisors (18216322000513).
210122312030111 is a wasteful number, since it uses less digits than its factorization.
210122312030111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2176131 (or 2176118 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 210122312030111 its reverse (111030213221012), we get a palindrome (321152525251123).
The spelling of 210122312030111 in words is "two hundred ten trillion, one hundred twenty-two billion, three hundred twelve million, thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •