Base | Representation |
---|---|
bin | 10011010111100110111… |
… | …110011011110100010101 |
3 | 11201020121001222210101022 |
4 | 103113212332123310111 |
5 | 133301412111133023 |
6 | 2455243454210525 |
7 | 165106626335414 |
oct | 23274676336425 |
9 | 4636531883338 |
10 | 1331020021013 |
11 | 4735341140a1 |
12 | 195b63ab3a45 |
13 | 9868c8b9567 |
14 | 485c927347b |
15 | 249523877c8 |
hex | 135e6f9bd15 |
1331020021013 has 2 divisors, whose sum is σ = 1331020021014. Its totient is φ = 1331020021012.
The previous prime is 1331020020983. The next prime is 1331020021033. The reversal of 1331020021013 is 3101200201331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1297407565444 + 33612455569 = 1139038^2 + 183337^2 .
It is a cyclic number.
It is not a de Polignac number, because 1331020021013 - 222 = 1331015826709 is a prime.
It is a super-2 number, since 2×13310200210132 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1331020020982 and 1331020021000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1331020021033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665510010506 + 665510010507.
It is an arithmetic number, because the mean of its divisors is an integer number (665510010507).
Almost surely, 21331020021013 is an apocalyptic number.
It is an amenable number.
1331020021013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331020021013 is an equidigital number, since it uses as much as digits as its factorization.
1331020021013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1331020021013 its reverse (3101200201331), we get a palindrome (4432220222344).
The spelling of 1331020021013 in words is "one trillion, three hundred thirty-one billion, twenty million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •