Base | Representation |
---|---|
bin | 1010000110001010110100… |
… | …10011011100110010001110 |
3 | 2220121111202120011111000120 |
4 | 11003011122103130302032 |
5 | 10402230101424013402 |
6 | 115115314512205410 |
7 | 4451025144462543 |
oct | 503053223346216 |
9 | 86544676144016 |
10 | 22202201001102 |
11 | 708a99a7227a1 |
12 | 25a6b28239866 |
13 | c50873b59495 |
14 | 56a84124abca |
15 | 2877e46513bc |
hex | 14315a4dcc8e |
22202201001102 has 8 divisors (see below), whose sum is σ = 44404402002216. Its totient is φ = 7400733667032.
The previous prime is 22202201001091. The next prime is 22202201001109. The reversal of 22202201001102 is 20110010220222.
It is a sphenic number, since it is the product of 3 distinct primes.
22202201001102 is an admirable number.
It is a super-3 number, since 3×222022010011023 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22202201001109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1850183416753 + ... + 1850183416764.
It is an arithmetic number, because the mean of its divisors is an integer number (5550550250277).
Almost surely, 222202201001102 is an apocalyptic number.
22202201001102 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.
22202201001102 is a wasteful number, since it uses less digits than its factorization.
22202201001102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3700366833522.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 22202201001102 its reverse (20110010220222), we get a palindrome (42312211221324).
The spelling of 22202201001102 in words is "twenty-two trillion, two hundred two billion, two hundred one million, one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •