Base | Representation |
---|---|
bin | 110011101100010110… |
… | …1111101111011101101 |
3 | 101121112111002221110111 |
4 | 1213120231331323231 |
5 | 3304322042024323 |
6 | 122555231540021 |
7 | 11006635243051 |
oct | 1473055757355 |
9 | 347474087414 |
10 | 111010111213 |
11 | 4309634a671 |
12 | 1962108a611 |
13 | a611867451 |
14 | 5531403c61 |
15 | 2d4ab24c0d |
hex | 19d8b7deed |
111010111213 has 2 divisors, whose sum is σ = 111010111214. Its totient is φ = 111010111212.
The previous prime is 111010111193. The next prime is 111010111217. The reversal of 111010111213 is 312111010111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77864995849 + 33145115364 = 279043^2 + 182058^2 .
It is a cyclic number.
It is not a de Polignac number, because 111010111213 - 213 = 111010103021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111010111193 and 111010111202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111010111217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55505055606 + 55505055607.
It is an arithmetic number, because the mean of its divisors is an integer number (55505055607).
Almost surely, 2111010111213 is an apocalyptic number.
It is an amenable number.
111010111213 is a deficient number, since it is larger than the sum of its proper divisors (1).
111010111213 is an equidigital number, since it uses as much as digits as its factorization.
111010111213 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 111010111213 its reverse (312111010111), we get a palindrome (423121121324).
It can be divided in two parts, 11101011 and 1213, that added together give a square (11102224 = 33322).
The spelling of 111010111213 in words is "one hundred eleven billion, ten million, one hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •