Base | Representation |
---|---|
bin | 1011000110110010101011… |
… | …1110101111010000111001 |
3 | 1121020101112101222102121111 |
4 | 2301230222332233100321 |
5 | 3100032232124041441 |
6 | 41545444431240321 |
7 | 2400144502562464 |
oct | 261545276572071 |
9 | 47211471872544 |
10 | 12211313112121 |
11 | 39888749a3642 |
12 | 14527740790a1 |
13 | 6a76a2775436 |
14 | 3030603982db |
15 | 16299e683081 |
hex | b1b2afaf439 |
12211313112121 has 2 divisors, whose sum is σ = 12211313112122. Its totient is φ = 12211313112120.
The previous prime is 12211313112113. The next prime is 12211313112149. The reversal of 12211313112121 is 12121131311221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10459978487721 + 1751334624400 = 3234189^2 + 1323380^2 .
It is a cyclic number.
It is not a de Polignac number, because 12211313112121 - 23 = 12211313112113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12211313112092 and 12211313112101.
It is not a weakly prime, because it can be changed into another prime (12211313112101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105656556060 + 6105656556061.
It is an arithmetic number, because the mean of its divisors is an integer number (6105656556061).
Almost surely, 212211313112121 is an apocalyptic number.
It is an amenable number.
12211313112121 is a deficient number, since it is larger than the sum of its proper divisors (1).
12211313112121 is an equidigital number, since it uses as much as digits as its factorization.
12211313112121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 144, while the sum is 22.
Adding to 12211313112121 its reverse (12121131311221), we get a palindrome (24332444423342).
The spelling of 12211313112121 in words is "twelve trillion, two hundred eleven billion, three hundred thirteen million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •