Base | Representation |
---|---|
bin | 1011000110110101010010… |
… | …0101000011001100110110 |
3 | 1121020110100001012212202120 |
4 | 2301231110211003030312 |
5 | 3100040144310133420 |
6 | 41550042002020410 |
7 | 2400201005654535 |
oct | 261552445031466 |
9 | 47213301185676 |
10 | 12212011021110 |
11 | 39890a2944a2a |
12 | 1452929947706 |
13 | 6a7784231b34 |
14 | 3030c8d4a31c |
15 | 1629e0a90d40 |
hex | b1b54943336 |
12212011021110 has 32 divisors (see below), whose sum is σ = 29309030399232. Its totient is φ = 3256513611360.
The previous prime is 12212011021073. The next prime is 12212011021153. The reversal of 12212011021110 is 1112011021221.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12212011021110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3215025 + ... + 5895795.
It is an arithmetic number, because the mean of its divisors is an integer number (915907199976).
Almost surely, 212212011021110 is an apocalyptic number.
12212011021110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12212011021110 is an abundant number, since it is smaller than the sum of its proper divisors (17097019378122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12212011021110 is a wasteful number, since it uses less digits than its factorization.
12212011021110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2832628.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 12212011021110 its reverse (1112011021221), we get a palindrome (13324022042331).
The spelling of 12212011021110 in words is "twelve trillion, two hundred twelve billion, eleven million, twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •