Base | Representation |
---|---|
bin | 10000001011110101000… |
… | …000000111100011001101 |
3 | 10221022210222010012210100 |
4 | 100023311000013203031 |
5 | 121210302233324323 |
6 | 2210535415201313 |
7 | 143232436052532 |
oct | 20136500074315 |
9 | 3838728105710 |
10 | 1112212011213 |
11 | 399760759846 |
12 | 15b679676239 |
13 | 80b5bb41204 |
14 | 3bb8d312d89 |
15 | 1dde7b4e943 |
hex | 102f50078cd |
1112212011213 has 6 divisors (see below), whose sum is σ = 1606528460654. Its totient is φ = 741474674136.
The previous prime is 1112212011173. The next prime is 1112212011259. The reversal of 1112212011213 is 3121102122111.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1094915289924 + 17296721289 = 1046382^2 + 131517^2 .
It is not a de Polignac number, because 1112212011213 - 221 = 1112209914061 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112212081213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 61789556170 + ... + 61789556187.
Almost surely, 21112212011213 is an apocalyptic number.
It is an amenable number.
1112212011213 is a deficient number, since it is larger than the sum of its proper divisors (494316449441).
1112212011213 is a wasteful number, since it uses less digits than its factorization.
1112212011213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123579112363 (or 123579112360 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 1112212011213 its reverse (3121102122111), we get a palindrome (4233314133324).
The spelling of 1112212011213 in words is "one trillion, one hundred twelve billion, two hundred twelve million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •