Base | Representation |
---|---|
bin | 1001001011111101001100… |
… | …10110100010101100011111 |
3 | 2122112021221122201112121202 |
4 | 10211332212112202230133 |
5 | 10121442220130321343 |
6 | 110544403021150115 |
7 | 4153355640510056 |
oct | 445764626425437 |
9 | 78467848645552 |
10 | 20202022120223 |
11 | 64896a1904079 |
12 | 23233543bb33b |
13 | b37072523748 |
14 | 4dbad6b1539d |
15 | 25077aadbdb8 |
hex | 125fa65a2b1f |
20202022120223 has 8 divisors (see below), whose sum is σ = 21265331195520. Its totient is φ = 19138717520280.
The previous prime is 20202022120187. The next prime is 20202022120237. The reversal of 20202022120223 is 32202122020202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20202022120223 - 212 = 20202022116127 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20202022120195 and 20202022120204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20202022120283) 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, 12231788 + ... + 13784798.
It is an arithmetic number, because the mean of its divisors is an integer number (2658166399440).
Almost surely, 220202022120223 is an apocalyptic number.
20202022120223 is a deficient number, since it is larger than the sum of its proper divisors (1063309075297).
20202022120223 is a wasteful number, since it uses less digits than its factorization.
20202022120223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2237677.
The product of its (nonzero) digits is 768, while the sum is 20.
Adding to 20202022120223 its reverse (32202122020202), we get a palindrome (52404144140425).
The spelling of 20202022120223 in words is "twenty trillion, two hundred two billion, twenty-two million, one hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •