Base | Representation |
---|---|
bin | 1010000110001011000001… |
… | …10111100100001111000111 |
3 | 2220121112001020101201100112 |
4 | 11003011200313210033013 |
5 | 10402230313122211403 |
6 | 115115333444503235 |
7 | 4451030652541304 |
oct | 503054067441707 |
9 | 86545036351315 |
10 | 22202311132103 |
11 | 708aa46903853 |
12 | 25a6b590aab1b |
13 | c5089090935b |
14 | 56a851b180ab |
15 | 2877ee1579d8 |
hex | 143160de43c7 |
22202311132103 has 4 divisors (see below), whose sum is σ = 22223080367160. Its totient is φ = 22181541897048.
The previous prime is 22202311132049. The next prime is 22202311132123. The reversal of 22202311132103 is 30123111320222.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22202311132103 - 26 = 22202311132039 is a prime.
It is a super-3 number, since 3×222023111321033 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22202311132123) 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, 10384615925 + ... + 10384618062.
It is an arithmetic number, because the mean of its divisors is an integer number (5555770091790).
Almost surely, 222202311132103 is an apocalyptic number.
22202311132103 is a deficient number, since it is larger than the sum of its proper divisors (20769235057).
22202311132103 is a wasteful number, since it uses less digits than its factorization.
22202311132103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20769235056.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 22202311132103 its reverse (30123111320222), we get a palindrome (52325422452325).
The spelling of 22202311132103 in words is "twenty-two trillion, two hundred two billion, three hundred eleven million, one hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •