Base | Representation |
---|---|
bin | 11110100101110001100… |
… | …011000000101101111011 |
3 | 21102222000000211020120110 |
4 | 132211301203000231323 |
5 | 233420142331324011 |
6 | 4245413413355403 |
7 | 304606042162623 |
oct | 36456143005573 |
9 | 7388000736513 |
10 | 2102144011131 |
11 | 74057254520a |
12 | 29b4ab938b63 |
13 | 123301301148 |
14 | 73a5c575883 |
15 | 39a35574ba6 |
hex | 1e9718c0b7b |
2102144011131 has 4 divisors (see below), whose sum is σ = 2802858681512. Its totient is φ = 1401429340752.
The previous prime is 2102144011069. The next prime is 2102144011189. The reversal of 2102144011131 is 1311104412012.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2102144011131 - 29 = 2102144010619 is a prime.
It is a super-2 number, since 2×21021440111312 (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 = 2102144011098 and 2102144011107.
It is not an unprimeable number, because it can be changed into a prime (2102144011831) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 350357335186 + ... + 350357335191.
It is an arithmetic number, because the mean of its divisors is an integer number (700714670378).
Almost surely, 22102144011131 is an apocalyptic number.
2102144011131 is a deficient number, since it is larger than the sum of its proper divisors (700714670381).
2102144011131 is an equidigital number, since it uses as much as digits as its factorization.
2102144011131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 700714670380.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 2102144011131 its reverse (1311104412012), we get a palindrome (3413248423143).
The spelling of 2102144011131 in words is "two trillion, one hundred two billion, one hundred forty-four million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •