Base | Representation |
---|---|
bin | 10000010011001011111… |
… | …000111111000100100101 |
3 | 10222002012112201220110022 |
4 | 100103023320333010211 |
5 | 121322442211211323 |
6 | 2214323352004525 |
7 | 143632265456633 |
oct | 20231370770445 |
9 | 3862175656408 |
10 | 1120112210213 |
11 | 3a2045161227 |
12 | 161103390745 |
13 | 8181a7b0289 |
14 | 3c2dc63c353 |
15 | 1e20b4d44c8 |
hex | 104cbe3f125 |
1120112210213 has 2 divisors, whose sum is σ = 1120112210214. Its totient is φ = 1120112210212.
The previous prime is 1120112210201. The next prime is 1120112210249. The reversal of 1120112210213 is 3120122110211.
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., 794552956129 + 325559254084 = 891377^2 + 570578^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120112210213 - 214 = 1120112193829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1120112210191 and 1120112210200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120112210293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560056105106 + 560056105107.
It is an arithmetic number, because the mean of its divisors is an integer number (560056105107).
Almost surely, 21120112210213 is an apocalyptic number.
It is an amenable number.
1120112210213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120112210213 is an equidigital number, since it uses as much as digits as its factorization.
1120112210213 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 1120112210213 its reverse (3120122110211), we get a palindrome (4240234320424).
The spelling of 1120112210213 in words is "one trillion, one hundred twenty billion, one hundred twelve million, two hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •