Base | Representation |
---|---|
bin | 10011000111000110111… |
… | …101110010110110001101 |
3 | 11122112212100111121200210 |
4 | 103013012331302312031 |
5 | 133004121044104401 |
6 | 2443153443313033 |
7 | 163611606162600 |
oct | 23070675626615 |
9 | 4575770447623 |
10 | 1313303113101 |
11 | 466a72407a41 |
12 | 19263a67b779 |
13 | 96ac8216bb5 |
14 | 477c8298337 |
15 | 24266c9d4d6 |
hex | 131c6f72d8d |
1313303113101 has 48 divisors (see below), whose sum is σ = 2145462197760. Its totient is φ = 710532073440.
The previous prime is 1313303113093. The next prime is 1313303113153. The reversal of 1313303113101 is 1013113033131.
It is not a de Polignac number, because 1313303113101 - 23 = 1313303113093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1313303113181) 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 47 ways as a sum of consecutive naturals, for example, 4514896 + ... + 4796966.
It is an arithmetic number, because the mean of its divisors is an integer number (44697129120).
Almost surely, 21313303113101 is an apocalyptic number.
It is an amenable number.
1313303113101 is a deficient number, since it is larger than the sum of its proper divisors (832159084659).
1313303113101 is a wasteful number, since it uses less digits than its factorization.
1313303113101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283774 (or 283767 counting only the distinct ones).
The product of its (nonzero) digits is 243, while the sum is 21.
Adding to 1313303113101 its reverse (1013113033131), we get a palindrome (2326416146232).
The spelling of 1313303113101 in words is "one trillion, three hundred thirteen billion, three hundred three million, one hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •