Base | Representation |
---|---|
bin | 10000000001100101010… |
… | …010101000010010100101 |
3 | 10220021102021210110102212 |
4 | 100001211102220102211 |
5 | 121020240004311323 |
6 | 2201520033413205 |
7 | 142363015100366 |
oct | 20014522502245 |
9 | 3807367713385 |
10 | 1101211010213 |
11 | 3950259a7986 |
12 | 15950940a205 |
13 | 7cac7956072 |
14 | 3b428261b6d |
15 | 1d9a1e63b78 |
hex | 100654a84a5 |
1101211010213 has 2 divisors, whose sum is σ = 1101211010214. Its totient is φ = 1101211010212.
The previous prime is 1101211010191. The next prime is 1101211010261. The reversal of 1101211010213 is 3120101121011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1045379463844 + 55831546369 = 1022438^2 + 236287^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101211010213 - 26 = 1101211010149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101211013213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550605505106 + 550605505107.
It is an arithmetic number, because the mean of its divisors is an integer number (550605505107).
Almost surely, 21101211010213 is an apocalyptic number.
It is an amenable number.
1101211010213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101211010213 is an equidigital number, since it uses as much as digits as its factorization.
1101211010213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1101211010213 its reverse (3120101121011), we get a palindrome (4221312131224).
The spelling of 1101211010213 in words is "one trillion, one hundred one billion, two hundred eleven million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •