Base | Representation |
---|---|
bin | 1001001001111001011110… |
… | …01011010110110000101001 |
3 | 2122021112102010122022012122 |
4 | 10210330233023112300221 |
5 | 10114312402111103223 |
6 | 110452105405521025 |
7 | 4145303314010123 |
oct | 444745713266051 |
9 | 78245363568178 |
10 | 20131303222313 |
11 | 64617019353a8 |
12 | 23116b8873175 |
13 | b304b218111a |
14 | 4d8508846213 |
15 | 24d9dc3245c8 |
hex | 124f2f2d6c29 |
20131303222313 has 2 divisors, whose sum is σ = 20131303222314. Its totient is φ = 20131303222312.
The previous prime is 20131303222301. The next prime is 20131303222337. The reversal of 20131303222313 is 31322230313102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18733687467049 + 1397615755264 = 4328243^2 + 1182208^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20131303222313 is a prime.
It is not a weakly prime, because it can be changed into another prime (20131303422313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10065651611156 + 10065651611157.
It is an arithmetic number, because the mean of its divisors is an integer number (10065651611157).
Almost surely, 220131303222313 is an apocalyptic number.
It is an amenable number.
20131303222313 is a deficient number, since it is larger than the sum of its proper divisors (1).
20131303222313 is an equidigital number, since it uses as much as digits as its factorization.
20131303222313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 20131303222313 its reverse (31322230313102), we get a palindrome (51453533535415).
The spelling of 20131303222313 in words is "twenty trillion, one hundred thirty-one billion, three hundred three million, two hundred twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •