Base | Representation |
---|---|
bin | 1001001100100100110110… |
… | …10110001110001011110001 |
3 | 2122121022220101222220210010 |
4 | 10212102123112032023301 |
5 | 10122314320423321223 |
6 | 111002243400125133 |
7 | 4155041350322031 |
oct | 446223326161361 |
9 | 78538811886703 |
10 | 20223312323313 |
11 | 6497727649840 |
12 | 23274b64667a9 |
13 | b390862b6058 |
14 | 4dcb564cb8c1 |
15 | 2510c4c60393 |
hex | 12649b58e2f1 |
20223312323313 has 8 divisors (see below), whose sum is σ = 29415727015776. Its totient is φ = 12256552923200.
The previous prime is 20223312323017. The next prime is 20223312323317. The reversal of 20223312323313 is 31332321332202.
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 20223312323313 - 210 = 20223312322289 is a prime.
It is a super-2 number, since 2×202233123233132 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20223312323317) 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, 306413823048 + ... + 306413823113.
It is an arithmetic number, because the mean of its divisors is an integer number (3676965876972).
Almost surely, 220223312323313 is an apocalyptic number.
It is an amenable number.
20223312323313 is a deficient number, since it is larger than the sum of its proper divisors (9192414692463).
20223312323313 is a wasteful number, since it uses less digits than its factorization.
20223312323313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 612827646175.
The product of its (nonzero) digits is 23328, while the sum is 30.
Adding to 20223312323313 its reverse (31332321332202), we get a palindrome (51555633655515).
The spelling of 20223312323313 in words is "twenty trillion, two hundred twenty-three billion, three hundred twelve million, three hundred twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •