Base | Representation |
---|---|
bin | 1011000110111010001000… |
… | …0000101011100110010101 |
3 | 1121020120200120200102211122 |
4 | 2301232202000223212111 |
5 | 3100100324342010401 |
6 | 41550414530013325 |
7 | 2400245132022152 |
oct | 261564200534625 |
9 | 47216616612748 |
10 | 12213310110101 |
11 | 39896aa17a7a1 |
12 | 1453030a17245 |
13 | 6a793040b249 |
14 | 3031ad6b1229 |
15 | 162a69b5121b |
hex | b1ba202b995 |
12213310110101 has 2 divisors, whose sum is σ = 12213310110102. Its totient is φ = 12213310110100.
The previous prime is 12213310110049. The next prime is 12213310110107. The reversal of 12213310110101 is 10101101331221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8270599498225 + 3942710611876 = 2875865^2 + 1985626^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12213310110101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12213310110101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12213310110107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6106655055050 + 6106655055051.
It is an arithmetic number, because the mean of its divisors is an integer number (6106655055051).
Almost surely, 212213310110101 is an apocalyptic number.
It is an amenable number.
12213310110101 is a deficient number, since it is larger than the sum of its proper divisors (1).
12213310110101 is an equidigital number, since it uses as much as digits as its factorization.
12213310110101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 12213310110101 its reverse (10101101331221), we get a palindrome (22314411441322).
The spelling of 12213310110101 in words is "twelve trillion, two hundred thirteen billion, three hundred ten million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •