Base | Representation |
---|---|
bin | 10011000111000000111… |
… | …000101001100011001101 |
3 | 11122112121020112212102000 |
4 | 103013000320221203031 |
5 | 133003413440213010 |
6 | 2443135401022513 |
7 | 163606230120333 |
oct | 23070070514315 |
9 | 4575536485360 |
10 | 1313201101005 |
11 | 466a1a871822 |
12 | 192610484a39 |
13 | 96ab004a601 |
14 | 477b8901b53 |
15 | 2425cd4c7c0 |
hex | 131c0e298cd |
1313201101005 has 32 divisors (see below), whose sum is σ = 2367461157120. Its totient is φ = 690509494080.
The previous prime is 1313201101001. The next prime is 1313201101063. The reversal of 1313201101005 is 5001011023131.
1313201101005 is a `hidden beast` number, since 131 + 320 + 110 + 100 + 5 = 666.
It is not a de Polignac number, because 1313201101005 - 22 = 1313201101001 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1313201101001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68493342 + ... + 68512511.
It is an arithmetic number, because the mean of its divisors is an integer number (73983161160).
Almost surely, 21313201101005 is an apocalyptic number.
1313201101005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1313201101005 is a deficient number, since it is larger than the sum of its proper divisors (1054260056115).
1313201101005 is a wasteful number, since it uses less digits than its factorization.
1313201101005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137005938 (or 137005932 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 18.
Adding to 1313201101005 its reverse (5001011023131), we get a palindrome (6314212124136).
The spelling of 1313201101005 in words is "one trillion, three hundred thirteen billion, two hundred one million, one hundred one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •