Base | Representation |
---|---|
bin | 1011110010001001011… |
… | …1110110110110000101 |
3 | 201100112101211202022221 |
4 | 2330202113312312011 |
5 | 11304044134022323 |
6 | 232555534452341 |
7 | 20424440550151 |
oct | 2744227666605 |
9 | 640471752287 |
10 | 202440142213 |
11 | 78944201161 |
12 | 332989640b1 |
13 | 16122a212ca |
14 | 9b261d0061 |
15 | 53ec7c955d |
hex | 2f225f6d85 |
202440142213 has 8 divisors (see below), whose sum is σ = 213120564800. Its totient is φ = 191762287488.
The previous prime is 202440142193. The next prime is 202440142279. The reversal of 202440142213 is 312241044202.
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 202440142213 - 213 = 202440134021 is a prime.
It is a super-3 number, since 3×2024401422133 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202440142283) 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, 479073 + ... + 796486.
It is an arithmetic number, because the mean of its divisors is an integer number (26640070600).
Almost surely, 2202440142213 is an apocalyptic number.
It is an amenable number.
202440142213 is a deficient number, since it is larger than the sum of its proper divisors (10680422587).
202440142213 is a wasteful number, since it uses less digits than its factorization.
202440142213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1283931.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 202440142213 its reverse (312241044202), we get a palindrome (514681186415).
The spelling of 202440142213 in words is "two hundred two billion, four hundred forty million, one hundred forty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •