Base | Representation |
---|---|
bin | 1011000110101110010000… |
… | …0011010100110011100101 |
3 | 1121020021110110211011221121 |
4 | 2301223210003110303211 |
5 | 3100022313010212013 |
6 | 41545130402013541 |
7 | 2400103143116203 |
oct | 261534403246345 |
9 | 47207413734847 |
10 | 12210123132133 |
11 | 3988314211003 |
12 | 14524a16472b1 |
13 | 6a754307b974 |
14 | 302d8a316073 |
15 | 16292ee7658d |
hex | b1ae40d4ce5 |
12210123132133 has 2 divisors, whose sum is σ = 12210123132134. Its totient is φ = 12210123132132.
The previous prime is 12210123132107. The next prime is 12210123132169. The reversal of 12210123132133 is 33123132101221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11080490015169 + 1129633116964 = 3328737^2 + 1062842^2 .
It is a cyclic number.
It is not a de Polignac number, because 12210123132133 - 213 = 12210123123941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12210123132098 and 12210123132107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12210123132833) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105061566066 + 6105061566067.
It is an arithmetic number, because the mean of its divisors is an integer number (6105061566067).
Almost surely, 212210123132133 is an apocalyptic number.
It is an amenable number.
12210123132133 is a deficient number, since it is larger than the sum of its proper divisors (1).
12210123132133 is an equidigital number, since it uses as much as digits as its factorization.
12210123132133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 12210123132133 its reverse (33123132101221), we get a palindrome (45333255233354).
The spelling of 12210123132133 in words is "twelve trillion, two hundred ten billion, one hundred twenty-three million, one hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •