Base | Representation |
---|---|
bin | 1011000000111101010111… |
… | …1001001000001001100110 |
3 | 1120212210212110211102221100 |
4 | 2300033111321020021212 |
5 | 3041412013420030042 |
6 | 41431432501100530 |
7 | 2356666244515452 |
oct | 260172571101146 |
9 | 46783773742840 |
10 | 12111101330022 |
11 | 394a31aa68512 |
12 | 14372673b7746 |
13 | 69b0c2114956 |
14 | 2dc275169662 |
15 | 160086a6324c |
hex | b03d5e48266 |
12111101330022 has 24 divisors (see below), whose sum is σ = 26373921178176. Its totient is φ = 4016541218256.
The previous prime is 12111101330011. The next prime is 12111101330089. The reversal of 12111101330022 is 22003310111121.
12111101330022 is a `hidden beast` number, since 1 + 211 + 1 + 101 + 330 + 0 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 12111101329977 and 12111101330004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1707709558 + ... + 1707716649.
It is an arithmetic number, because the mean of its divisors is an integer number (1098913382424).
Almost surely, 212111101330022 is an apocalyptic number.
12111101330022 is an abundant number, since it is smaller than the sum of its proper divisors (14262819848154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12111101330022 is a wasteful number, since it uses less digits than its factorization.
12111101330022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3415426412 (or 3415426409 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 12111101330022 its reverse (22003310111121), we get a palindrome (34114411441143).
The spelling of 12111101330022 in words is "twelve trillion, one hundred eleven billion, one hundred one million, three hundred thirty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •