Base | Representation |
---|---|
bin | 100000001011011100011… |
… | …111011111101111001101 |
3 | 21211101210011110201202011 |
4 | 200023130133133233031 |
5 | 242212231440343000 |
6 | 4411510215501221 |
7 | 315522245362414 |
oct | 40133437375715 |
9 | 7741704421664 |
10 | 2211312434125 |
11 | 7828a32471a3 |
12 | 2b8698087811 |
13 | 1306ab440442 |
14 | 7905713047b |
15 | 3c7c46592ba |
hex | 202dc7dfbcd |
2211312434125 has 32 divisors (see below), whose sum is σ = 2912062233600. Its totient is φ = 1673121788800.
The previous prime is 2211312434113. The next prime is 2211312434137. The reversal of 2211312434125 is 5214342131122.
It is an interprime number because it is at equal distance from previous prime (2211312434113) and next prime (2211312434137).
It is a de Polignac number, because none of the positive numbers 2k-2211312434125 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4065205 + ... + 4576954.
It is an arithmetic number, because the mean of its divisors is an integer number (91001944800).
Almost surely, 22211312434125 is an apocalyptic number.
2211312434125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2211312434125 is a deficient number, since it is larger than the sum of its proper divisors (700749799475).
2211312434125 is an equidigital number, since it uses as much as digits as its factorization.
2211312434125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8642286 (or 8642276 counting only the distinct ones).
The product of its digits is 11520, while the sum is 31.
Adding to 2211312434125 its reverse (5214342131122), we get a palindrome (7425654565247).
The spelling of 2211312434125 in words is "two trillion, two hundred eleven billion, three hundred twelve million, four hundred thirty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.352 sec. • engine limits •