Base | Representation |
---|---|
bin | 1011000110110101101100… |
… | …1100011100010111110001 |
3 | 1121020110121210001202102201 |
4 | 2301231123030130113301 |
5 | 3100040411213323441 |
6 | 41550101004543201 |
7 | 2400203524241554 |
oct | 261553314342761 |
9 | 47213553052381 |
10 | 12212122011121 |
11 | 398914a56240a |
12 | 145295ab51b01 |
13 | 6a77a12229b6 |
14 | 3030d999c69b |
15 | 1629ea6b6c31 |
hex | b1b5b31c5f1 |
12212122011121 has 4 divisors (see below), whose sum is σ = 12214126962544. Its totient is φ = 12210117059700.
The previous prime is 12212122011109. The next prime is 12212122011137. The reversal of 12212122011121 is 12111022121221.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12212122011121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12212126011121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1002466575 + ... + 1002478756.
It is an arithmetic number, because the mean of its divisors is an integer number (3053531740636).
Almost surely, 212212122011121 is an apocalyptic number.
It is an amenable number.
12212122011121 is a deficient number, since it is larger than the sum of its proper divisors (2004951423).
12212122011121 is an equidigital number, since it uses as much as digits as its factorization.
12212122011121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2004951422.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 12212122011121 its reverse (12111022121221), we get a palindrome (24323144132342).
The spelling of 12212122011121 in words is "twelve trillion, two hundred twelve billion, one hundred twenty-two million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •