Base | Representation |
---|---|
bin | 11011100010100001111001… |
… | …001000110110110100010110 |
3 | 120212211222011201120100012222 |
4 | 123202201321020312310112 |
5 | 111333412441142041042 |
6 | 1105333451015542342 |
7 | 34340432145065000 |
oct | 3342417110666426 |
9 | 525758151510188 |
10 | 121120110112022 |
11 | 35657828621a9a |
12 | 11701a7b98a9b2 |
13 | 5277767653bc8 |
14 | 21ca35d2c3370 |
15 | e0092a8732d2 |
hex | 6e2879236d16 |
121120110112022 has 16 divisors (see below), whose sum is σ = 211871912733600. Its totient is φ = 51908618619144.
The previous prime is 121120110112021. The next prime is 121120110112051. The reversal of 121120110112022 is 220211011021121.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121120110112021) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 88279962953 + ... + 88279964324.
It is an arithmetic number, because the mean of its divisors is an integer number (13241994545850).
Almost surely, 2121120110112022 is an apocalyptic number.
121120110112022 is a deficient number, since it is larger than the sum of its proper divisors (90751802621578).
121120110112022 is an equidigital number, since it uses as much as digits as its factorization.
121120110112022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176559927300 (or 176559927286 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 121120110112022 its reverse (220211011021121), we get a palindrome (341331121133143).
Subtracting 121120110112022 from its reverse (220211011021121), we obtain a palindrome (99090900909099).
The spelling of 121120110112022 in words is "one hundred twenty-one trillion, one hundred twenty billion, one hundred ten million, one hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •