Base | Representation |
---|---|
bin | 10010110100001001… |
… | …110011111100101101 |
3 | 1221010221021012202001 |
4 | 102310021303330231 |
5 | 312333244341031 |
6 | 13140354132301 |
7 | 1313430025564 |
oct | 226411637455 |
9 | 57127235661 |
10 | 20202340141 |
11 | 8627770185 |
12 | 3ab9881091 |
13 | 1b9c5a1129 |
14 | d99116bdb |
15 | 7d38d8861 |
hex | 4b4273f2d |
20202340141 has 8 divisors (see below), whose sum is σ = 20755017080. Its totient is φ = 19650014208.
The previous prime is 20202340091. The next prime is 20202340153. The reversal of 20202340141 is 14104320202.
It can be written as a sum of positive squares in 4 ways, for example, as 3268523241 + 16933816900 = 57171^2 + 130130^2 .
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 20202340141 - 221 = 20200242989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20202740141) 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, 31105 + ... + 203401.
It is an arithmetic number, because the mean of its divisors is an integer number (2594377135).
Almost surely, 220202340141 is an apocalyptic number.
It is an amenable number.
20202340141 is a deficient number, since it is larger than the sum of its proper divisors (552676939).
20202340141 is a wasteful number, since it uses less digits than its factorization.
20202340141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175503.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 20202340141 its reverse (14104320202), we get a palindrome (34306660343).
The spelling of 20202340141 in words is "twenty billion, two hundred two million, three hundred forty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •