Base | Representation |
---|---|
bin | 1010000100001000010100… |
… | …11010001110101001110011 |
3 | 2220100210220222010222111100 |
4 | 11002010022122032221303 |
5 | 10400103111111433321 |
6 | 115023210522015443 |
7 | 4442665042400646 |
oct | 502041232165163 |
9 | 86323828128440 |
10 | 22132141124211 |
11 | 7063208754298 |
12 | 2595435347583 |
13 | c4708a1a8c21 |
14 | 5672b66c9a5d |
15 | 285a93b64326 |
hex | 14210a68ea73 |
22132141124211 has 48 divisors (see below), whose sum is σ = 32966194225536. Its totient is φ = 14299972460928.
The previous prime is 22132141124209. The next prime is 22132141124227. The reversal of 22132141124211 is 11242114123122.
22132141124211 is a `hidden beast` number, since 2 + 2 + 1 + 3 + 2 + 1 + 411 + 242 + 1 + 1 = 666.
It is not a de Polignac number, because 22132141124211 - 21 = 22132141124209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (22132141124201) 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, 38636656 + ... + 39205298.
It is an arithmetic number, because the mean of its divisors is an integer number (686795713032).
Almost surely, 222132141124211 is an apocalyptic number.
22132141124211 is a deficient number, since it is larger than the sum of its proper divisors (10834053101325).
22132141124211 is a wasteful number, since it uses less digits than its factorization.
22132141124211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 569472 (or 569469 counting only the distinct ones).
The product of its digits is 1536, while the sum is 27.
Adding to 22132141124211 its reverse (11242114123122), we get a palindrome (33374255247333).
The spelling of 22132141124211 in words is "twenty-two trillion, one hundred thirty-two billion, one hundred forty-one million, one hundred twenty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •