Base | Representation |
---|---|
bin | 11110101111111111110… |
… | …101011001111100001101 |
3 | 21111000100001012202221210 |
4 | 132233333311121330031 |
5 | 234110133002213201 |
6 | 4254430543245033 |
7 | 305445053156424 |
oct | 36577765317415 |
9 | 7430301182853 |
10 | 2113121132301 |
11 | 745195876883 |
12 | 2a1653ba9779 |
13 | 124360577c0a |
14 | 743c03ac2bb |
15 | 39e790e51d6 |
hex | 1ebffd59f0d |
2113121132301 has 16 divisors (see below), whose sum is σ = 2849468194496. Its totient is φ = 1392850308096.
The previous prime is 2113121132201. The next prime is 2113121132321. The reversal of 2113121132301 is 1032311213112.
It is not a de Polignac number, because 2113121132301 - 219 = 2113120608013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2113121132321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11100730 + ... + 11289483.
It is an arithmetic number, because the mean of its divisors is an integer number (178091762156).
Almost surely, 22113121132301 is an apocalyptic number.
It is an amenable number.
2113121132301 is a deficient number, since it is larger than the sum of its proper divisors (736347062195).
2113121132301 is a wasteful number, since it uses less digits than its factorization.
2113121132301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22390572.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 2113121132301 its reverse (1032311213112), we get a palindrome (3145432345413).
It can be divided in two parts, 2113121 and 132301, that added together give a palindrome (2245422).
The spelling of 2113121132301 in words is "two trillion, one hundred thirteen billion, one hundred twenty-one million, one hundred thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •