Base | Representation |
---|---|
bin | 1010000110000111000110… |
… | …01101110011011001000101 |
3 | 2220121022121022122010211212 |
4 | 11003003203031303121011 |
5 | 10402212003434012013 |
6 | 115114344340541205 |
7 | 4450624504150250 |
oct | 503034315633105 |
9 | 86538538563755 |
10 | 22200203032133 |
11 | 708a064943075 |
12 | 25a666b0b1805 |
13 | c50615c43719 |
14 | 56a6d1b60097 |
15 | 2877290406a8 |
hex | 1430e3373645 |
22200203032133 has 8 divisors (see below), whose sum is σ = 25371819811968. Its totient is φ = 19028626053264.
The previous prime is 22200203032129. The next prime is 22200203032151. The reversal of 22200203032133 is 33123030200222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22200203032133 - 22 = 22200203032129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22200203032099 and 22200203032108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22200203032933) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8745266 + ... + 10994547.
It is an arithmetic number, because the mean of its divisors is an integer number (3171477476496).
Almost surely, 222200203032133 is an apocalyptic number.
It is an amenable number.
22200203032133 is a deficient number, since it is larger than the sum of its proper divisors (3171616779835).
22200203032133 is a wasteful number, since it uses less digits than its factorization.
22200203032133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19900483.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 22200203032133 its reverse (33123030200222), we get a palindrome (55323233232355).
The spelling of 22200203032133 in words is "twenty-two trillion, two hundred billion, two hundred three million, thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •