Base | Representation |
---|---|
bin | 110011110010010100… |
… | …0011111001100111101 |
3 | 101122001102020101222211 |
4 | 1213210220133030331 |
5 | 3310224230014323 |
6 | 123031132140421 |
7 | 11014613261533 |
oct | 1474450371475 |
9 | 348042211884 |
10 | 111210001213 |
11 | 43189167a13 |
12 | 19678007711 |
13 | a6440b365c |
14 | 554db98153 |
15 | 2d5d45b70d |
hex | 19e4a1f33d |
111210001213 has 2 divisors, whose sum is σ = 111210001214. Its totient is φ = 111210001212.
The previous prime is 111210001207. The next prime is 111210001237. The reversal of 111210001213 is 312100012111.
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., 86178647844 + 25031353369 = 293562^2 + 158213^2 .
It is a cyclic number.
It is not a de Polignac number, because 111210001213 - 29 = 111210000701 is a prime.
It is a super-2 number, since 2×1112100012132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 111210001193 and 111210001202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111210001313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55605000606 + 55605000607.
It is an arithmetic number, because the mean of its divisors is an integer number (55605000607).
Almost surely, 2111210001213 is an apocalyptic number.
It is an amenable number.
111210001213 is a deficient number, since it is larger than the sum of its proper divisors (1).
111210001213 is an equidigital number, since it uses as much as digits as its factorization.
111210001213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 111210001213 its reverse (312100012111), we get a palindrome (423310013324).
The spelling of 111210001213 in words is "one hundred eleven billion, two hundred ten million, one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •