Base | Representation |
---|---|
bin | 110000000000010111001011… |
… | …100110000011100001100110 |
3 | 1000200112221022222120101211012 |
4 | 300000113023212003201212 |
5 | 210133133020004321410 |
6 | 2025012144324342222 |
7 | 62320502023604405 |
oct | 6000271346034146 |
9 | 1020487288511735 |
10 | 211131123120230 |
11 | 6130022a908225 |
12 | 1b81a761b44972 |
13 | 90a676c171b31 |
14 | 3a1cb2d8a163c |
15 | 1962011ead605 |
hex | c005cb983866 |
211131123120230 has 64 divisors (see below), whose sum is σ = 396635959353600. Its totient is φ = 80818473738240.
The previous prime is 211131123120209. The next prime is 211131123120233. The reversal of 211131123120230 is 32021321131112.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 211131123120196 and 211131123120205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211131123120233) 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 31 ways as a sum of consecutive naturals, for example, 8208056 + ... + 22127684.
It is an arithmetic number, because the mean of its divisors is an integer number (6197436864900).
Almost surely, 2211131123120230 is an apocalyptic number.
211131123120230 is a deficient number, since it is larger than the sum of its proper divisors (185504836233370).
211131123120230 is a wasteful number, since it uses less digits than its factorization.
211131123120230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13920129.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 211131123120230 its reverse (32021321131112), we get a palindrome (243152444251342).
The spelling of 211131123120230 in words is "two hundred eleven trillion, one hundred thirty-one billion, one hundred twenty-three million, one hundred twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •