Base | Representation |
---|---|
bin | 100000001011001010100… |
… | …010000010100011001000 |
3 | 21211101000011110221021120 |
4 | 200023022202002203020 |
5 | 242211122321023422 |
6 | 4411420253235240 |
7 | 315511626232566 |
oct | 40131242024310 |
9 | 7741004427246 |
10 | 2211011111112 |
11 | 782759149811 |
12 | 2b8613192b20 |
13 | 130660b9b3bb |
14 | 790290d4a36 |
15 | 3c7a7e8845c |
hex | 202ca8828c8 |
2211011111112 has 32 divisors (see below), whose sum is σ = 5818450293600. Its totient is φ = 698214034944.
The previous prime is 2211011111081. The next prime is 2211011111117. The reversal of 2211011111112 is 2111111101122.
It is a junction number, because it is equal to n+sod(n) for n = 2211011111091 and 2211011111100.
It is not an unprimeable number, because it can be changed into a prime (2211011111117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2424353833 + ... + 2424354744.
It is an arithmetic number, because the mean of its divisors is an integer number (181826571675).
Almost surely, 22211011111112 is an apocalyptic number.
It is an amenable number.
2211011111112 is an abundant number, since it is smaller than the sum of its proper divisors (3607439182488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2211011111112 is a wasteful number, since it uses less digits than its factorization.
2211011111112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4848708605 (or 4848708601 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 2211011111112 its reverse (2111111101122), we get a palindrome (4322122212234).
The spelling of 2211011111112 in words is "two trillion, two hundred eleven billion, eleven million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •