Base | Representation |
---|---|
bin | 10010101111111010… |
… | …001101001011110101 |
3 | 1220221222021212222102 |
4 | 102233322031023311 |
5 | 312212032442331 |
6 | 13125332111445 |
7 | 1311603604154 |
oct | 225772151365 |
9 | 56858255872 |
10 | 20131140341 |
11 | 85a055a774 |
12 | 3a99a65585 |
13 | 1b8a902480 |
14 | d8d8a159b |
15 | 7cc5224cb |
hex | 4afe8d2f5 |
20131140341 has 8 divisors (see below), whose sum is σ = 21690196920. Its totient is φ = 18573584832.
The previous prime is 20131140311. The next prime is 20131140391. The reversal of 20131140341 is 14304113102.
It can be written as a sum of positive squares in 4 ways, for example, as 208947025 + 19922193316 = 14455^2 + 141146^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20131140341 is a prime.
It is a super-2 number, since 2×201311403412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20131140311) 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, 347330 + ... + 401123.
It is an arithmetic number, because the mean of its divisors is an integer number (2711274615).
Almost surely, 220131140341 is an apocalyptic number.
It is an amenable number.
20131140341 is a deficient number, since it is larger than the sum of its proper divisors (1559056579).
20131140341 is a wasteful number, since it uses less digits than its factorization.
20131140341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 750535.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 20131140341 its reverse (14304113102), we get a palindrome (34435253443).
The spelling of 20131140341 in words is "twenty billion, one hundred thirty-one million, one hundred forty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •