Base | Representation |
---|---|
bin | 10000000001011111011… |
… | …000111011111011010101 |
3 | 10220021011101111020020211 |
4 | 100001133120323323111 |
5 | 121020034133001323 |
6 | 2201502135325421 |
7 | 142360403400451 |
oct | 20013730737325 |
9 | 3807141436224 |
10 | 1101112000213 |
11 | 394a85022235 |
12 | 1594a0220871 |
13 | 7cab029b074 |
14 | 3b41904b661 |
15 | 1d99840770d |
hex | 1005f63bed5 |
1101112000213 has 2 divisors, whose sum is σ = 1101112000214. Its totient is φ = 1101112000212.
The previous prime is 1101112000141. The next prime is 1101112000223. The reversal of 1101112000213 is 3120002111011.
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., 986936941809 + 114175058404 = 993447^2 + 337898^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101112000213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1101112000193 and 1101112000202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101112000223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550556000106 + 550556000107.
It is an arithmetic number, because the mean of its divisors is an integer number (550556000107).
Almost surely, 21101112000213 is an apocalyptic number.
It is an amenable number.
1101112000213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101112000213 is an equidigital number, since it uses as much as digits as its factorization.
1101112000213 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 13.
Adding to 1101112000213 its reverse (3120002111011), we get a palindrome (4221114111224).
The spelling of 1101112000213 in words is "one trillion, one hundred one billion, one hundred twelve million, two hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •