Base | Representation |
---|---|
bin | 11110101111111001010… |
… | …001011010000001000011 |
3 | 21111000001101001002220201 |
4 | 132233321101122001003 |
5 | 234104421311012011 |
6 | 4254412011350031 |
7 | 305442245266606 |
oct | 36577121320103 |
9 | 7430041032821 |
10 | 2113011032131 |
11 | 7451397069aa |
12 | 2a1623152317 |
13 | 12434380909c |
14 | 743ad90c33d |
15 | 39e6e5e7cc1 |
hex | 1ebf945a043 |
2113011032131 has 8 divisors (see below), whose sum is σ = 2122328142000. Its totient is φ = 2103704752800.
The previous prime is 2113011032129. The next prime is 2113011032141. The reversal of 2113011032131 is 1312301103112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2113011032131 - 21 = 2113011032129 is a prime.
It is a super-2 number, since 2×21130110321312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2113011032099 and 2113011032108.
It is not an unprimeable number, because it can be changed into a prime (2113011032141) 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, 2316456 + ... + 3097093.
It is an arithmetic number, because the mean of its divisors is an integer number (265291017750).
Almost surely, 22113011032131 is an apocalyptic number.
2113011032131 is a deficient number, since it is larger than the sum of its proper divisors (9317109869).
2113011032131 is a wasteful number, since it uses less digits than its factorization.
2113011032131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5415269.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 2113011032131 its reverse (1312301103112), we get a palindrome (3425312135243).
The spelling of 2113011032131 in words is "two trillion, one hundred thirteen billion, eleven million, thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •