Base | Representation |
---|---|
bin | 11000000101001… |
… | …01011000110111 |
3 | 112002002212102111 |
4 | 30002211120313 |
5 | 403203112043 |
6 | 32013351451 |
7 | 5002002004 |
oct | 1402453067 |
9 | 462085374 |
10 | 202004023 |
11 | a4031681 |
12 | 57798587 |
13 | 32b09510 |
14 | 1cb848ab |
15 | 12b0309d |
hex | c0a5637 |
202004023 has 8 divisors (see below), whose sum is σ = 221230800. Its totient is φ = 183304128.
The previous prime is 202004021. The next prime is 202004051. The reversal of 202004023 is 320400202.
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 202004023 - 21 = 202004021 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202003994 and 202004012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202004021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130918 + ... + 132451.
It is an arithmetic number, because the mean of its divisors is an integer number (27653850).
Almost surely, 2202004023 is an apocalyptic number.
202004023 is a deficient number, since it is larger than the sum of its proper divisors (19226777).
202004023 is a wasteful number, since it uses less digits than its factorization.
202004023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263441.
The product of its (nonzero) digits is 96, while the sum is 13.
The square root of 202004023 is about 14212.8119314934. The cubic root of 202004023 is about 586.7503260014.
Adding to 202004023 its reverse (320400202), we get a palindrome (522404225).
The spelling of 202004023 in words is "two hundred two million, four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •