Base | Representation |
---|---|
bin | 10010110000101100… |
… | …000100100010100011 |
3 | 1220222212220000002210 |
4 | 102300230010202203 |
5 | 312223404242011 |
6 | 13130520213203 |
7 | 1312122656301 |
oct | 226054044243 |
9 | 56885800083 |
10 | 20144212131 |
11 | 85a79787aa |
12 | 3aa230a203 |
13 | 1b9052b264 |
14 | d91505271 |
15 | 7cd7556a6 |
hex | 4b0b048a3 |
20144212131 has 4 divisors (see below), whose sum is σ = 26858949512. Its totient is φ = 13429474752.
The previous prime is 20144212073. The next prime is 20144212139. The reversal of 20144212131 is 13121244102.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 20144212131 - 210 = 20144211107 is a prime.
It is a super-2 number, since 2×201442121312 (a number of 21 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 = 20144212098 and 20144212107.
It is not an unprimeable number, because it can be changed into a prime (20144212139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3357368686 + ... + 3357368691.
It is an arithmetic number, because the mean of its divisors is an integer number (6714737378).
Almost surely, 220144212131 is an apocalyptic number.
20144212131 is a deficient number, since it is larger than the sum of its proper divisors (6714737381).
20144212131 is an equidigital number, since it uses as much as digits as its factorization.
20144212131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6714737380.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 20144212131 its reverse (13121244102), we get a palindrome (33265456233).
The spelling of 20144212131 in words is "twenty billion, one hundred forty-four million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •