Base | Representation |
---|---|
bin | 10011000111000110111… |
… | …101110010010110111101 |
3 | 11122112212100111111221201 |
4 | 103013012331302112331 |
5 | 133004121044023401 |
6 | 2443153443255501 |
7 | 163611606154012 |
oct | 23070675622675 |
9 | 4575770444851 |
10 | 1313303111101 |
11 | 466a72406493 |
12 | 19263a67a591 |
13 | 96ac8216007 |
14 | 477c8297709 |
15 | 24266c9cb01 |
hex | 131c6f725bd |
1313303111101 has 4 divisors (see below), whose sum is σ = 1314119335900. Its totient is φ = 1312486886304.
The previous prime is 1313303111069. The next prime is 1313303111143. The reversal of 1313303111101 is 1011113033131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 588465423225 + 724837687876 = 767115^2 + 851374^2 .
It is a cyclic number.
It is not a de Polignac number, because 1313303111101 - 25 = 1313303111069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1313303111161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 408109986 + ... + 408113203.
It is an arithmetic number, because the mean of its divisors is an integer number (328529833975).
Almost surely, 21313303111101 is an apocalyptic number.
It is an amenable number.
1313303111101 is a deficient number, since it is larger than the sum of its proper divisors (816224799).
1313303111101 is an equidigital number, since it uses as much as digits as its factorization.
1313303111101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 816224798.
The product of its (nonzero) digits is 81, while the sum is 19.
Adding to 1313303111101 its reverse (1011113033131), we get a palindrome (2324416144232).
The spelling of 1313303111101 in words is "one trillion, three hundred thirteen billion, three hundred three million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •