Base | Representation |
---|---|
bin | 1001000110001000110101… |
… | …10110001010010101110111 |
3 | 2121211011221122122021100002 |
4 | 10203010122312022111313 |
5 | 10110203311423300343 |
6 | 110312502141141515 |
7 | 4133051003061446 |
oct | 443043266122567 |
9 | 77734848567302 |
10 | 20002113103223 |
11 | 6411937435839 |
12 | 22b066325a89b |
13 | b2126400ba84 |
14 | 4d2170b58d5d |
15 | 24a47a63a8b8 |
hex | 12311ad8a577 |
20002113103223 has 8 divisors (see below), whose sum is σ = 20184974064000. Its totient is φ = 19819354793728.
The previous prime is 20002113103213. The next prime is 20002113103261. The reversal of 20002113103223 is 32230131120002.
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 20002113103223 - 210 = 20002113102199 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20002113103195 and 20002113103204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002113103213) 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, 25271303 + ... + 26050776.
It is an arithmetic number, because the mean of its divisors is an integer number (2523121758000).
Almost surely, 220002113103223 is an apocalyptic number.
20002113103223 is a deficient number, since it is larger than the sum of its proper divisors (182860960777).
20002113103223 is a wasteful number, since it uses less digits than its factorization.
20002113103223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51325641.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20002113103223 its reverse (32230131120002), we get a palindrome (52232244223225).
The spelling of 20002113103223 in words is "twenty trillion, two billion, one hundred thirteen million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •