Base | Representation |
---|---|
bin | 11011100011101100100000… |
… | …001011111000010100101110 |
3 | 120220010121221212102112222001 |
4 | 123203230200023320110232 |
5 | 111341221023330023042 |
6 | 1105434340254042514 |
7 | 34346266326615205 |
oct | 3343544013702456 |
9 | 526117855375861 |
10 | 121200222111022 |
11 | 356887a877562a |
12 | 117154b91a943a |
13 | 5282193a40c02 |
14 | 21d019cc9423c |
15 | e02a68ab6bb7 |
hex | 6e3b202f852e |
121200222111022 has 4 divisors (see below), whose sum is σ = 181800333166536. Its totient is φ = 60600111055510.
The previous prime is 121200222110951. The next prime is 121200222111103. The reversal of 121200222111022 is 220111222002121.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1212002221110222 (a number of 29 digits) contains 22 as substring.
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 as a sum of consecutive naturals, namely, 30300055527754 + ... + 30300055527757.
It is an arithmetic number, because the mean of its divisors is an integer number (45450083291634).
Almost surely, 2121200222111022 is an apocalyptic number.
121200222111022 is a deficient number, since it is larger than the sum of its proper divisors (60600111055514).
121200222111022 is an equidigital number, since it uses as much as digits as its factorization.
121200222111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60600111055513.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 121200222111022 its reverse (220111222002121), we get a palindrome (341311444113143).
It can be divided in two parts, 121200 and 222111022, that added together give a palindrome (222232222).
The spelling of 121200222111022 in words is "one hundred twenty-one trillion, two hundred billion, two hundred twenty-two million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •