Base | Representation |
---|---|
bin | 100000001011011100011… |
… | …010011111001011011000 |
3 | 21211101210002000000122001 |
4 | 200023130122133023120 |
5 | 242212231121333422 |
6 | 4411510131410344 |
7 | 315522231253402 |
oct | 40133432371330 |
9 | 7741702000561 |
10 | 2211311121112 |
11 | 7828a252a765 |
12 | 2b86977539b4 |
13 | 1306ab0a0902 |
14 | 79056cabb72 |
15 | 3c7c449a227 |
hex | 202dc69f2d8 |
2211311121112 has 32 divisors (see below), whose sum is σ = 4417013361600. Its totient is φ = 1034843118624.
The previous prime is 2211311121059. The next prime is 2211311121113. The reversal of 2211311121112 is 2111211131122.
It is a super-2 number, since 2×22113111211122 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 2211311121112.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2211311121113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 87626538 + ... + 87651769.
It is an arithmetic number, because the mean of its divisors is an integer number (138031667550).
Almost surely, 22211311121112 is an apocalyptic number.
It is an amenable number.
2211311121112 is a deficient number, since it is larger than the sum of its proper divisors (2205702240488).
2211311121112 is a wasteful number, since it uses less digits than its factorization.
2211311121112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 175278415 (or 175278411 counting only the distinct ones).
The product of its digits is 48, while the sum is 19.
Adding to 2211311121112 its reverse (2111211131122), we get a palindrome (4322522252234).
The spelling of 2211311121112 in words is "two trillion, two hundred eleven billion, three hundred eleven million, one hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •