Base | Representation |
---|---|
bin | 1011000001000000110011… |
… | …0001101000011101111001 |
3 | 1120212220020122110000112001 |
4 | 2300100030301220131321 |
5 | 3041420410130041441 |
6 | 41432104112421001 |
7 | 2360031125161411 |
oct | 260201461503571 |
9 | 46786218400461 |
10 | 12112022112121 |
11 | 394a7527a4758 |
12 | 1437483847761 |
13 | 69b20ab06729 |
14 | 2dc321575641 |
15 | 1600dc7e7731 |
hex | b040cc68779 |
12112022112121 has 2 divisors, whose sum is σ = 12112022112122. Its totient is φ = 12112022112120.
The previous prime is 12112022112061. The next prime is 12112022112137. The reversal of 12112022112121 is 12121122021121.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8991362073600 + 3120660038521 = 2998560^2 + 1766539^2 .
It is a cyclic number.
It is not a de Polignac number, because 12112022112121 - 27 = 12112022111993 is a prime.
It is not a weakly prime, because it can be changed into another prime (12112022112191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6056011056060 + 6056011056061.
It is an arithmetic number, because the mean of its divisors is an integer number (6056011056061).
Almost surely, 212112022112121 is an apocalyptic number.
It is an amenable number.
12112022112121 is a deficient number, since it is larger than the sum of its proper divisors (1).
12112022112121 is an equidigital number, since it uses as much as digits as its factorization.
12112022112121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 12112022112121 its reverse (12121122021121), we get a palindrome (24233144133242).
The spelling of 12112022112121 in words is "twelve trillion, one hundred twelve billion, twenty-two million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •