Base | Representation |
---|---|
bin | 11111000000101111100… |
… | …110001010101100000101 |
3 | 21112201202011222102001111 |
4 | 133000233212022230011 |
5 | 234403444143010341 |
6 | 4311003114325021 |
7 | 306652462531420 |
oct | 37005746125405 |
9 | 7481664872044 |
10 | 2131102313221 |
11 | 751882775182 |
12 | 2a5031a29771 |
13 | 125c6791973b |
14 | 752084da9b7 |
15 | 3a67c9d2681 |
hex | 1f02f98ab05 |
2131102313221 has 8 divisors (see below), whose sum is σ = 2457889955840. Its totient is φ = 1809900784368.
The previous prime is 2131102313201. The next prime is 2131102313237. The reversal of 2131102313221 is 1223132011312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2131102313221 - 215 = 2131102280453 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2131102313192 and 2131102313201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2131102313201) 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, 1396527621 + ... + 1396529146.
It is an arithmetic number, because the mean of its divisors is an integer number (307236244480).
Almost surely, 22131102313221 is an apocalyptic number.
It is an amenable number.
2131102313221 is a deficient number, since it is larger than the sum of its proper divisors (326787642619).
2131102313221 is a wasteful number, since it uses less digits than its factorization.
2131102313221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2793056883.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 2131102313221 its reverse (1223132011312), we get a palindrome (3354234324533).
The spelling of 2131102313221 in words is "two trillion, one hundred thirty-one billion, one hundred two million, three hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •