Base | Representation |
---|---|
bin | 11101001000100011000… |
… | …00000101000100011101 |
3 | 10112200210212121200221102 |
4 | 32210101200011010131 |
5 | 112400042334031023 |
6 | 2043510202042445 |
7 | 132215143061204 |
oct | 16442140050435 |
9 | 3480725550842 |
10 | 1001021002013 |
11 | 35659229390a |
12 | 142007aa9425 |
13 | 7351b97a246 |
14 | 36641ca023b |
15 | 1b08b1e5628 |
hex | e91180511d |
1001021002013 has 2 divisors, whose sum is σ = 1001021002014. Its totient is φ = 1001021002012.
The previous prime is 1001021001989. The next prime is 1001021002027. The reversal of 1001021002013 is 3102001201001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 685893706969 + 315127295044 = 828187^2 + 561362^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001021002013 - 216 = 1001020936477 is a prime.
It is a super-2 number, since 2×10010210020132 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1001021001985 and 1001021002003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1001021002073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500510501006 + 500510501007.
It is an arithmetic number, because the mean of its divisors is an integer number (500510501007).
Almost surely, 21001021002013 is an apocalyptic number.
It is an amenable number.
1001021002013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001021002013 is an equidigital number, since it uses as much as digits as its factorization.
1001021002013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 1001021002013 its reverse (3102001201001), we get a palindrome (4103022203014).
The spelling of 1001021002013 in words is "one trillion, one billion, twenty-one million, two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •