Base | Representation |
---|---|
bin | 101101111011110001110011… |
… | …101010101110000100000111 |
3 | 222111021220222200222210202220 |
4 | 231323301303222232010013 |
5 | 202434344001203010343 |
6 | 1553354414514103423 |
7 | 60360315323551602 |
oct | 5573616352560407 |
9 | 874256880883686 |
10 | 202020022313223 |
11 | 59408234a43434 |
12 | 1a7a8a0087ab73 |
13 | 8895538a1116a |
14 | 37c5b6d727339 |
15 | 185500ec44183 |
hex | b7bc73aae107 |
202020022313223 has 8 divisors (see below), whose sum is σ = 269360905383936. Its totient is φ = 134679577059000.
The previous prime is 202020022313209. The next prime is 202020022313243. The reversal of 202020022313223 is 322313220020202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 202020022313223 - 25 = 202020022313191 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202020022313193 and 202020022313202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202020022313243) 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, 108375943 + ... + 110224248.
It is an arithmetic number, because the mean of its divisors is an integer number (33670113172992).
Almost surely, 2202020022313223 is an apocalyptic number.
202020022313223 is a deficient number, since it is larger than the sum of its proper divisors (67340883070713).
202020022313223 is a wasteful number, since it uses less digits than its factorization.
202020022313223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218908245.
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 202020022313223 its reverse (322313220020202), we get a palindrome (524333242333425).
The spelling of 202020022313223 in words is "two hundred two trillion, twenty billion, twenty-two million, three hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •