Base | Representation |
---|---|
bin | 110011101100101101… |
… | …1110010000011111101 |
3 | 101121120022201010002022 |
4 | 1213121123302003331 |
5 | 3304333130334323 |
6 | 123000341205525 |
7 | 11010142313453 |
oct | 1473133620375 |
9 | 347508633068 |
10 | 111022121213 |
11 | 430a2102993 |
12 | 196251008a5 |
13 | a6141b0b63 |
14 | 5532c4c9d3 |
15 | 2d4bbe84c8 |
hex | 19d96f20fd |
111022121213 has 2 divisors, whose sum is σ = 111022121214. Its totient is φ = 111022121212.
The previous prime is 111022121201. The next prime is 111022121257. The reversal of 111022121213 is 312121220111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108766061209 + 2256060004 = 329797^2 + 47498^2 .
It is a cyclic number.
It is not a de Polignac number, because 111022121213 - 210 = 111022120189 is a prime.
It is a super-2 number, since 2×1110221212132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111022121191 and 111022121200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111022121263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55511060606 + 55511060607.
It is an arithmetic number, because the mean of its divisors is an integer number (55511060607).
Almost surely, 2111022121213 is an apocalyptic number.
It is an amenable number.
111022121213 is a deficient number, since it is larger than the sum of its proper divisors (1).
111022121213 is an equidigital number, since it uses as much as digits as its factorization.
111022121213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 111022121213 its reverse (312121220111), we get a palindrome (423143341324).
The spelling of 111022121213 in words is "one hundred eleven billion, twenty-two million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •