Base | Representation |
---|---|
bin | 10010101111010100… |
… | …110011000101110011 |
3 | 1220221021211200101110 |
4 | 102233110303011303 |
5 | 312202030143011 |
6 | 13124342004403 |
7 | 1311424342503 |
oct | 225724630563 |
9 | 56837750343 |
10 | 20121334131 |
11 | 8595a72168 |
12 | 3a96716703 |
13 | 1b8887ab92 |
14 | d8c46ba03 |
15 | 7cb736ba6 |
hex | 4af533173 |
20121334131 has 8 divisors (see below), whose sum is σ = 26829160384. Its totient is φ = 13413865320.
The previous prime is 20121334111. The next prime is 20121334141. The reversal of 20121334131 is 13143312102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20121334131 - 26 = 20121334067 is a prime.
It is a super-2 number, since 2×201213341312 (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 = 20121334098 and 20121334107.
It is not an unprimeable number, because it can be changed into a prime (20121334111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 98280 + ... + 223386.
It is an arithmetic number, because the mean of its divisors is an integer number (3353645048).
Almost surely, 220121334131 is an apocalyptic number.
20121334131 is a deficient number, since it is larger than the sum of its proper divisors (6707826253).
20121334131 is a wasteful number, since it uses less digits than its factorization.
20121334131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178721.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 20121334131 its reverse (13143312102), we get a palindrome (33264646233).
The spelling of 20121334131 in words is "twenty billion, one hundred twenty-one million, three hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •