Base | Representation |
---|---|
bin | 101101111011100001001000… |
… | …001000011000001000011111 |
3 | 222111020012202111121200201100 |
4 | 231323201020020120020133 |
5 | 202434100311134133043 |
6 | 1553342253354244143 |
7 | 60356112434564346 |
oct | 5573411010301037 |
9 | 874205674550640 |
10 | 202002112021023 |
11 | 59400684062856 |
12 | 1a7a5442726653 |
13 | 889394325c822 |
14 | 37c4d50bacb5d |
15 | 18548126aacd3 |
hex | b7b84821821f |
202002112021023 has 12 divisors (see below), whose sum is σ = 292515792783448. Its totient is φ = 134328860384400.
The previous prime is 202002112020979. The next prime is 202002112021043. The reversal of 202002112021023 is 320120211200202.
202002112021023 is a `hidden beast` number, since 2 + 0 + 200 + 211 + 20 + 210 + 23 = 666.
It is not a de Polignac number, because 202002112021023 - 217 = 202002111889951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202002112020987 and 202002112021005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202002112021043) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 28267854253 + ... + 28267861398.
Almost surely, 2202002112021023 is an apocalyptic number.
202002112021023 is a deficient number, since it is larger than the sum of its proper divisors (90513680762425).
202002112021023 is a wasteful number, since it uses less digits than its factorization.
202002112021023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56535716054 (or 56535716051 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 202002112021023 its reverse (320120211200202), we get a palindrome (522122323221225).
The spelling of 202002112021023 in words is "two hundred two trillion, two billion, one hundred twelve million, twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •