Base | Representation |
---|---|
bin | 1001001111001100001000… |
… | …11011101111001100110001 |
3 | 2122220220201102010200200111 |
4 | 10213212010123233030301 |
5 | 10130302233241102023 |
6 | 111111415225421321 |
7 | 4164401050613143 |
oct | 447460433571461 |
9 | 78826642120614 |
10 | 20313122206513 |
11 | 6521823a18304 |
12 | 234099b63a841 |
13 | b44699901686 |
14 | 50323605ac93 |
15 | 2535ce58600d |
hex | 1279846ef331 |
20313122206513 has 2 divisors, whose sum is σ = 20313122206514. Its totient is φ = 20313122206512.
The previous prime is 20313122206499. The next prime is 20313122206529. The reversal of 20313122206513 is 31560222131302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14084618690704 + 6228503515809 = 3752948^2 + 2495697^2 .
It is a cyclic number.
It is not a de Polignac number, because 20313122206513 - 213 = 20313122198321 is a prime.
It is not a weakly prime, because it can be changed into another prime (20313122206583) 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, 10156561103256 + 10156561103257.
It is an arithmetic number, because the mean of its divisors is an integer number (10156561103257).
Almost surely, 220313122206513 is an apocalyptic number.
It is an amenable number.
20313122206513 is a deficient number, since it is larger than the sum of its proper divisors (1).
20313122206513 is an equidigital number, since it uses as much as digits as its factorization.
20313122206513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 20313122206513 its reverse (31560222131302), we get a palindrome (51873344337815).
The spelling of 20313122206513 in words is "twenty trillion, three hundred thirteen billion, one hundred twenty-two million, two hundred six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •