Base | Representation |
---|---|
bin | 11011100010010000010011… |
… | …001101100110110110011010 |
3 | 120212210011102020220000000202 |
4 | 123202100103031212312122 |
5 | 111333110244333241442 |
6 | 1105321044343502202 |
7 | 34336163062431353 |
oct | 3342202315466632 |
9 | 525704366800022 |
10 | 121101220212122 |
11 | 3564a814786677 |
12 | 116ba289757962 |
13 | 5275a46c55247 |
14 | 21c948a608d2a |
15 | e001c22d5c32 |
hex | 6e2413366d9a |
121101220212122 has 8 divisors (see below), whose sum is σ = 181653803291136. Its totient is φ = 60549952448412.
The previous prime is 121101220212121. The next prime is 121101220212319. The reversal of 121101220212122 is 221212022101121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 121101220212094 and 121101220212103.
It is not an unprimeable number, because it can be changed into a prime (121101220212121) 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 3 ways as a sum of consecutive naturals, for example, 328598618 + ... + 328966949.
It is an arithmetic number, because the mean of its divisors is an integer number (22706725411392).
Almost surely, 2121101220212122 is an apocalyptic number.
121101220212122 is a deficient number, since it is larger than the sum of its proper divisors (60552583079014).
121101220212122 is an equidigital number, since it uses as much as digits as its factorization.
121101220212122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 657657652.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 121101220212122 its reverse (221212022101121), we get a palindrome (342313242313243).
The spelling of 121101220212122 in words is "one hundred twenty-one trillion, one hundred one billion, two hundred twenty million, two hundred twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •