Base | Representation |
---|---|
bin | 10010101000000111… |
… | …000101110101111101 |
3 | 1220121212002112100011 |
4 | 102220013011311331 |
5 | 311430034103123 |
6 | 13104335503221 |
7 | 1305424514512 |
oct | 225007056575 |
9 | 56555075304 |
10 | 20000300413 |
11 | 85337147a5 |
12 | 3a62087b11 |
13 | 1b697815b2 |
14 | d7a363309 |
15 | 7c0cc9e0d |
hex | 4a81c5d7d |
20000300413 has 2 divisors, whose sum is σ = 20000300414. Its totient is φ = 20000300412.
The previous prime is 20000300401. The next prime is 20000300431. The reversal of 20000300413 is 31400300002.
Together with next prime (20000300431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19926992569 + 73307844 = 141163^2 + 8562^2 .
It is a cyclic number.
It is not a de Polignac number, because 20000300413 - 25 = 20000300381 is a prime.
It is a super-2 number, since 2×200003004132 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20000300393 and 20000300402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20000300443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000150206 + 10000150207.
It is an arithmetic number, because the mean of its divisors is an integer number (10000150207).
Almost surely, 220000300413 is an apocalyptic number.
It is an amenable number.
20000300413 is a deficient number, since it is larger than the sum of its proper divisors (1).
20000300413 is an equidigital number, since it uses as much as digits as its factorization.
20000300413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 13.
Adding to 20000300413 its reverse (31400300002), we get a palindrome (51400600415).
The spelling of 20000300413 in words is "twenty billion, three hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •