Base | Representation |
---|---|
bin | 1010000000100111000011… |
… | …10000111000010111100110 |
3 | 2212221020202101022000001120 |
4 | 11000103201300320113212 |
5 | 10341112414212041402 |
6 | 114451450012234410 |
7 | 4431154025635005 |
oct | 500234160702746 |
9 | 85836671260046 |
10 | 22011200112102 |
11 | 70169966a5913 |
12 | 2575b0246ba06 |
13 | c38855068a76 |
14 | 5614c23ccc3c |
15 | 2828662803bc |
hex | 1404e1c385e6 |
22011200112102 has 8 divisors (see below), whose sum is σ = 44022400224216. Its totient is φ = 7337066704032.
The previous prime is 22011200112089. The next prime is 22011200112107. The reversal of 22011200112102 is 20121100211022.
It is a sphenic number, since it is the product of 3 distinct primes.
22011200112102 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22011200112107) 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 3 ways as a sum of consecutive naturals, for example, 1834266676003 + ... + 1834266676014.
It is an arithmetic number, because the mean of its divisors is an integer number (5502800028027).
Almost surely, 222011200112102 is an apocalyptic number.
22011200112102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22011200112102 is a wasteful number, since it uses less digits than its factorization.
22011200112102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3668533352022.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 22011200112102 its reverse (20121100211022), we get a palindrome (42132300323124).
The spelling of 22011200112102 in words is "twenty-two trillion, eleven billion, two hundred million, one hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •