Base | Representation |
---|---|
bin | 101101111011110010101111… |
… | …010101001110110011101011 |
3 | 222111022000120110112212111120 |
4 | 231323302233111032303223 |
5 | 202434403023432010011 |
6 | 1553355102113030323 |
7 | 60360352200115641 |
oct | 5573625725166353 |
9 | 874260513485446 |
10 | 202021023313131 |
11 | 594086a8a8a490 |
12 | 1a7a903bb553a3 |
13 | 889566820b4b9 |
14 | 37c5c26655191 |
15 | 185506ca71a06 |
hex | b7bcaf54eceb |
202021023313131 has 32 divisors (see below), whose sum is σ = 296071170984960. Its totient is φ = 121511624925600.
The previous prime is 202021023313111. The next prime is 202021023313141. The reversal of 202021023313131 is 131313320120202.
It is not a de Polignac number, because 202021023313131 - 25 = 202021023313099 is a prime.
It is a super-2 number, since 2×2020210233131312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (202021023313111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4463736 + ... + 20590458.
It is an arithmetic number, because the mean of its divisors is an integer number (9252224093280).
Almost surely, 2202021023313131 is an apocalyptic number.
202021023313131 is a deficient number, since it is larger than the sum of its proper divisors (94050147671829).
202021023313131 is a wasteful number, since it uses less digits than its factorization.
202021023313131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16129607.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 202021023313131 its reverse (131313320120202), we get a palindrome (333334343433333).
The spelling of 202021023313131 in words is "two hundred two trillion, twenty-one billion, twenty-three million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •