Base | Representation |
---|---|
bin | 1001001111101110000001… |
… | …01000010101010001001001 |
3 | 2122222122200002110110120112 |
4 | 10213313000220111101021 |
5 | 10131102011333312223 |
6 | 111124024212204105 |
7 | 4165613602445123 |
oct | 447670050252111 |
9 | 78878602413515 |
10 | 20331312010313 |
11 | 6529508659107 |
12 | 2344417309635 |
13 | b463082592a5 |
14 | 50407db74213 |
15 | 253ce6432778 |
hex | 127dc0a15449 |
20331312010313 has 2 divisors, whose sum is σ = 20331312010314. Its totient is φ = 20331312010312.
The previous prime is 20331312010189. The next prime is 20331312010393. The reversal of 20331312010313 is 31301021313302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19293283177744 + 1038028832569 = 4392412^2 + 1018837^2 .
It is a cyclic number.
It is not a de Polignac number, because 20331312010313 - 228 = 20331043574857 is a prime.
It is not a weakly prime, because it can be changed into another prime (20331312010393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10165656005156 + 10165656005157.
It is an arithmetic number, because the mean of its divisors is an integer number (10165656005157).
Almost surely, 220331312010313 is an apocalyptic number.
It is an amenable number.
20331312010313 is a deficient number, since it is larger than the sum of its proper divisors (1).
20331312010313 is an equidigital number, since it uses as much as digits as its factorization.
20331312010313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 20331312010313 its reverse (31301021313302), we get a palindrome (51632333323615).
The spelling of 20331312010313 in words is "twenty trillion, three hundred thirty-one billion, three hundred twelve million, ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •