Base | Representation |
---|---|
bin | 1001000110101010010111… |
… | …00111110101111010110011 |
3 | 2121212220101222102111222202 |
4 | 10203111023213311322303 |
5 | 10111002141443133243 |
6 | 110325040121053415 |
7 | 4134256010203226 |
oct | 443251347657263 |
9 | 77786358374882 |
10 | 20020111302323 |
11 | 64195329a8150 |
12 | 22b404692726b |
13 | b22b71a5b722 |
14 | 4d2d9b2375bd |
15 | 24ab8078a4b8 |
hex | 12354b9f5eb3 |
20020111302323 has 16 divisors (see below), whose sum is σ = 23130632458080. Its totient is φ = 17125212172800.
The previous prime is 20020111302299. The next prime is 20020111302349. The reversal of 20020111302323 is 32320311102002.
It is a cyclic number.
It is not a de Polignac number, because 20020111302323 - 234 = 20002931433139 is a prime.
It is a super-2 number, since 2×200201113023232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20020111302295 and 20020111302304.
It is not an unprimeable number, because it can be changed into a prime (20020111302223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12673388 + ... + 14165273.
It is an arithmetic number, because the mean of its divisors is an integer number (1445664528630).
Almost surely, 220020111302323 is an apocalyptic number.
20020111302323 is a deficient number, since it is larger than the sum of its proper divisors (3110521155757).
20020111302323 is a wasteful number, since it uses less digits than its factorization.
20020111302323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26842678.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20020111302323 its reverse (32320311102002), we get a palindrome (52340422404325).
The spelling of 20020111302323 in words is "twenty trillion, twenty billion, one hundred eleven million, three hundred two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •