Base | Representation |
---|---|
bin | 11001000000101101100100… |
… | …111100111011010110101101 |
3 | 112102110220111011210202121211 |
4 | 121000231210330323112231 |
5 | 103404220201341024323 |
6 | 1025541203202554421 |
7 | 32112150023120455 |
oct | 3100554474732655 |
9 | 472426434722554 |
10 | 110000101111213 |
11 | 3205a865420585 |
12 | 1040690b368a11 |
13 | 494bc71213991 |
14 | 1d24067540d65 |
15 | cab54d53670d |
hex | 640b64f3b5ad |
110000101111213 has 2 divisors, whose sum is σ = 110000101111214. Its totient is φ = 110000101111212.
The previous prime is 110000101111189. The next prime is 110000101111291. The reversal of 110000101111213 is 312111101000011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84756088578249 + 25244012532964 = 9206307^2 + 5024342^2 .
It is a cyclic number.
It is not a de Polignac number, because 110000101111213 - 221 = 110000099014061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110000101111193 and 110000101111202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110000101111613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000050555606 + 55000050555607.
It is an arithmetic number, because the mean of its divisors is an integer number (55000050555607).
Almost surely, 2110000101111213 is an apocalyptic number.
It is an amenable number.
110000101111213 is a deficient number, since it is larger than the sum of its proper divisors (1).
110000101111213 is an equidigital number, since it uses as much as digits as its factorization.
110000101111213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 110000101111213 its reverse (312111101000011), we get a palindrome (422111202111224).
The spelling of 110000101111213 in words is "one hundred ten trillion, one hundred one million, one hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •