Base | Representation |
---|---|
bin | 10011000110111100110… |
… | …100111000000101101001 |
3 | 11122112102111102010122212 |
4 | 103012330310320011221 |
5 | 133003244022044423 |
6 | 2443124525254505 |
7 | 163604442235241 |
oct | 23067464700551 |
9 | 4575374363585 |
10 | 1313133003113 |
11 | 46699538a878 |
12 | 1925b1704435 |
13 | 96a9bbc67b9 |
14 | 477ad856b21 |
15 | 24256d9a578 |
hex | 131bcd38169 |
1313133003113 has 4 divisors (see below), whose sum is σ = 1313206066260. Its totient is φ = 1313059939968.
The previous prime is 1313133003071. The next prime is 1313133003151. The reversal of 1313133003113 is 3113003313131.
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 1085290983529 + 227842019584 = 1041773^2 + 477328^2 .
It is a cyclic number.
It is not a de Polignac number, because 1313133003113 - 238 = 1038255096169 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1313133006113) 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, 36504608 + ... + 36540561.
It is an arithmetic number, because the mean of its divisors is an integer number (328301516565).
Almost surely, 21313133003113 is an apocalyptic number.
It is an amenable number.
1313133003113 is a deficient number, since it is larger than the sum of its proper divisors (73063147).
1313133003113 is an equidigital number, since it uses as much as digits as its factorization.
1313133003113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73063146.
The product of its (nonzero) digits is 729, while the sum is 23.
Adding to 1313133003113 its reverse (3113003313131), we get a palindrome (4426136316244).
The spelling of 1313133003113 in words is "one trillion, three hundred thirteen billion, one hundred thirty-three million, three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •