Base | Representation |
---|---|
bin | 10011000110111100101… |
… | …101101001111011010100 |
3 | 11122112102100211221221021 |
4 | 103012330231221323110 |
5 | 133003243031010400 |
6 | 2443124420530524 |
7 | 163604420162245 |
oct | 23067455517324 |
9 | 4575370757837 |
10 | 1313131110100 |
11 | 4669943075a7 |
12 | 1925b0b50a44 |
13 | 96a9b6b2c84 |
14 | 477ad4c2ccc |
15 | 24256b2471a |
hex | 131bcb69ed4 |
1313131110100 has 72 divisors (see below), whose sum is σ = 2855554677248. Its totient is φ = 524136614400.
The previous prime is 1313131110059. The next prime is 1313131110101. The reversal of 1313131110100 is 10111313131.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1313131110101) 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 in 23 ways as a sum of consecutive naturals, for example, 95975260 + ... + 95988940.
Almost surely, 21313131110100 is an apocalyptic number.
1313131110100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1313131110100 is an abundant number, since it is smaller than the sum of its proper divisors (1542423567148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1313131110100 is a wasteful number, since it uses less digits than its factorization.
1313131110100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15665 (or 15658 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 1313131110100 its reverse (10111313131), we get a palindrome (1323242423231).
The spelling of 1313131110100 in words is "one trillion, three hundred thirteen billion, one hundred thirty-one million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •