Base | Representation |
---|---|
bin | 10001100111111011110… |
… | …110010001110010010110 |
3 | 11021210002102020111020020 |
4 | 101213323312101302112 |
5 | 124320323421320042 |
6 | 2324213214250010 |
7 | 153333314443656 |
oct | 21477366216226 |
9 | 4253072214206 |
10 | 1211111120022 |
11 | 4276a1721011 |
12 | 17687a7b6906 |
13 | 8a29054a43b |
14 | 42892082366 |
15 | 217853c93ec |
hex | 119fbd91c96 |
1211111120022 has 8 divisors (see below), whose sum is σ = 2422222240056. Its totient is φ = 403703706672.
The previous prime is 1211111120017. The next prime is 1211111120033. The reversal of 1211111120022 is 2200211111121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
1211111120022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1211111119983 and 1211111120010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 100925926663 + ... + 100925926674.
It is an arithmetic number, because the mean of its divisors is an integer number (302777780007).
Almost surely, 21211111120022 is an apocalyptic number.
1211111120022 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.
1211111120022 is a wasteful number, since it uses less digits than its factorization.
1211111120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201851853342.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1211111120022 its reverse (2200211111121), we get a palindrome (3411322231143).
The spelling of 1211111120022 in words is "one trillion, two hundred eleven billion, one hundred eleven million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •