Base | Representation |
---|---|
bin | 1011110000111101001… |
… | …1110101010000010111 |
3 | 201022201010001002202122 |
4 | 2330033103311100113 |
5 | 11302420300220043 |
6 | 232504111530155 |
7 | 20413505242016 |
oct | 2741723652027 |
9 | 638633032678 |
10 | 202120320023 |
11 | 7879a718aa6 |
12 | 3320982995b |
13 | 160a16a2ccb |
14 | 9ad593aa7d |
15 | 53ce6a2368 |
hex | 2f0f4f5417 |
202120320023 has 8 divisors (see below), whose sum is σ = 216052262496. Its totient is φ = 188617052800.
The previous prime is 202120320019. The next prime is 202120320043. The reversal of 202120320023 is 320023021202.
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 202120320023 - 22 = 202120320019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202120319983 and 202120320010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202120320043) 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, 107167838 + ... + 107169723.
It is an arithmetic number, because the mean of its divisors is an integer number (27006532812).
Almost surely, 2202120320023 is an apocalyptic number.
202120320023 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
202120320023 is a deficient number, since it is larger than the sum of its proper divisors (13931942473).
202120320023 is a wasteful number, since it uses less digits than its factorization.
202120320023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214337625.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 202120320023 its reverse (320023021202), we get a palindrome (522143341225).
The spelling of 202120320023 in words is "two hundred two billion, one hundred twenty million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •