Base | Representation |
---|---|
bin | 11111000000101111100… |
… | …101011110101101111001 |
3 | 21112201202011122020222211 |
4 | 133000233211132231321 |
5 | 234403444121224423 |
6 | 4311003110415121 |
7 | 306652461151342 |
oct | 37005745365571 |
9 | 7481664566884 |
10 | 2131102133113 |
11 | 751882661928 |
12 | 2a50319614a1 |
13 | 125c67885775 |
14 | 752084910c9 |
15 | 3a67c99910d |
hex | 1f02f95eb79 |
2131102133113 has 8 divisors (see below), whose sum is σ = 2194970846600. Its totient is φ = 2067563491200.
The previous prime is 2131102133099. The next prime is 2131102133117. The reversal of 2131102133113 is 3113312011312.
It can be written as a sum of positive squares in 4 ways, for example, as 1152342134784 + 978759998329 = 1073472^2 + 989323^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2131102133113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2131102133117) 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, 82504788 + ... + 82530613.
It is an arithmetic number, because the mean of its divisors is an integer number (274371355825).
Almost surely, 22131102133113 is an apocalyptic number.
It is an amenable number.
2131102133113 is a deficient number, since it is larger than the sum of its proper divisors (63868713487).
2131102133113 is a wasteful number, since it uses less digits than its factorization.
2131102133113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165035787.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 2131102133113 its reverse (3113312011312), we get a palindrome (5244414144425).
The spelling of 2131102133113 in words is "two trillion, one hundred thirty-one billion, one hundred two million, one hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •