Base | Representation |
---|---|
bin | 11101101100000110110… |
… | …11010001000011110101 |
3 | 10121112002101002122221200 |
4 | 32312003123101003311 |
5 | 113203142211242323 |
6 | 2100344425003113 |
7 | 133462221510153 |
oct | 16660333210365 |
9 | 3545071078850 |
10 | 1020112212213 |
11 | 363699827686 |
12 | 145855623499 |
13 | 75271ca1723 |
14 | 375335bc3d3 |
15 | 1b80729a443 |
hex | ed836d10f5 |
1020112212213 has 48 divisors (see below), whose sum is σ = 1509575099760. Its totient is φ = 663683328000.
The previous prime is 1020112212199. The next prime is 1020112212271. The reversal of 1020112212213 is 3122122110201.
It can be written as a sum of positive squares in 8 ways, for example, as 330219174609 + 689893037604 = 574647^2 + 830598^2 .
It is not a de Polignac number, because 1020112212213 - 25 = 1020112212181 is a prime.
It is a super-2 number, since 2×10201122122132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020112212313) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18564343 + ... + 18619211.
It is an arithmetic number, because the mean of its divisors is an integer number (31449481245).
Almost surely, 21020112212213 is an apocalyptic number.
It is an amenable number.
1020112212213 is a deficient number, since it is larger than the sum of its proper divisors (489462887547).
1020112212213 is a wasteful number, since it uses less digits than its factorization.
1020112212213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55270 (or 55267 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1020112212213 its reverse (3122122110201), we get a palindrome (4142234322414).
The spelling of 1020112212213 in words is "one trillion, twenty billion, one hundred twelve million, two hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •