Base | Representation |
---|---|
bin | 100000010011101001100… |
… | …001100011011110100101 |
3 | 21212020112001100212011002 |
4 | 200103221201203132211 |
5 | 242333301434342013 |
6 | 4415524242123045 |
7 | 316253445144023 |
oct | 40235141433645 |
9 | 7766461325132 |
10 | 2220121012133 |
11 | 786603484232 |
12 | 2ba336050485 |
13 | 13148334a98b |
14 | 79650d57713 |
15 | 3cb3cb23358 |
hex | 204e98637a5 |
2220121012133 has 8 divisors (see below), whose sum is σ = 2292101730816. Its totient is φ = 2148163038000.
The previous prime is 2220121012127. The next prime is 2220121012171. The reversal of 2220121012133 is 3312101210222.
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 2220121012133 - 26 = 2220121012069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2220121012183) 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 7 ways as a sum of consecutive naturals, for example, 5487641 + ... + 5878302.
It is an arithmetic number, because the mean of its divisors is an integer number (286512716352).
Almost surely, 22220121012133 is an apocalyptic number.
It is an amenable number.
2220121012133 is a deficient number, since it is larger than the sum of its proper divisors (71980718683).
2220121012133 is a wasteful number, since it uses less digits than its factorization.
2220121012133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11372275.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2220121012133 its reverse (3312101210222), we get a palindrome (5532222222355).
The spelling of 2220121012133 in words is "two trillion, two hundred twenty billion, one hundred twenty-one million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •