Base | Representation |
---|---|
bin | 1011000000111001101011… |
… | …0100010110001110100110 |
3 | 1120212201022101212220021000 |
4 | 2300032122310112032212 |
5 | 3041403001204034342 |
6 | 41431150254134130 |
7 | 2356632551315436 |
oct | 260163264261646 |
9 | 46781271786230 |
10 | 12110110221222 |
11 | 3949961567832 |
12 | 143702b4b1346 |
13 | 69ac9499b740 |
14 | 2dc1bd6942c6 |
15 | 160029a3b44c |
hex | b039ad163a6 |
12110110221222 has 64 divisors (see below), whose sum is σ = 29280238464960. Its totient is φ = 3687773432832.
The previous prime is 12110110221217. The next prime is 12110110221233. The reversal of 12110110221222 is 22212201101121.
12110110221222 is a `hidden beast` number, since 1 + 2 + 110 + 110 + 221 + 222 = 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 = 12110110221195 and 12110110221204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 88853913 + ... + 88990100.
It is an arithmetic number, because the mean of its divisors is an integer number (457503726015).
Almost surely, 212110110221222 is an apocalyptic number.
12110110221222 is an abundant number, since it is smaller than the sum of its proper divisors (17170128243738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12110110221222 is a wasteful number, since it uses less digits than its factorization.
12110110221222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177844134 (or 177844128 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 12110110221222 its reverse (22212201101121), we get a palindrome (34322311322343).
The spelling of 12110110221222 in words is "twelve trillion, one hundred ten billion, one hundred ten million, two hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •