Base | Representation |
---|---|
bin | 1011000000011100001101… |
… | …1001001000111001110110 |
3 | 1120211221220012022211220020 |
4 | 2300013003121020321312 |
5 | 3041240301430120042 |
6 | 41423401400350010 |
7 | 2356232552236011 |
oct | 260070331107166 |
9 | 46757805284806 |
10 | 12102201020022 |
11 | 3946572a76913 |
12 | 14355a2775306 |
13 | 69a3041ca029 |
14 | 2dba6d0a4378 |
15 | 15ec154c93ec |
hex | b01c3648e76 |
12102201020022 has 8 divisors (see below), whose sum is σ = 24204402040056. Its totient is φ = 4034067006672.
The previous prime is 12102201020017. The next prime is 12102201020053. The reversal of 12102201020022 is 22002010220121.
It is a sphenic number, since it is the product of 3 distinct primes.
12102201020022 is an admirable number.
It is a super-4 number, since 4×121022010200224 (a number of 53 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12102201019983 and 12102201020010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1008516751663 + ... + 1008516751674.
It is an arithmetic number, because the mean of its divisors is an integer number (3025550255007).
Almost surely, 212102201020022 is an apocalyptic number.
12102201020022 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.
12102201020022 is a wasteful number, since it uses less digits than its factorization.
12102201020022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2017033503342.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 12102201020022 its reverse (22002010220121), we get a palindrome (34104211240143).
The spelling of 12102201020022 in words is "twelve trillion, one hundred two billion, two hundred one million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •