Base | Representation |
---|---|
bin | 10011000110110110101… |
… | …111110001010000101101 |
3 | 11122112011101110220020202 |
4 | 103012312233301100231 |
5 | 133003041414014013 |
6 | 2443110443123245 |
7 | 163602063234335 |
oct | 23066657612055 |
9 | 4575141426222 |
10 | 1313031001133 |
11 | 466942851215 |
12 | 192583513525 |
13 | 96a83a319b7 |
14 | 477a00a40c5 |
15 | 2424ce4c858 |
hex | 131b6bf142d |
1313031001133 has 4 divisors (see below), whose sum is σ = 1313067291900. Its totient is φ = 1312994710368.
The previous prime is 1313031001123. The next prime is 1313031001141. The reversal of 1313031001133 is 3311001303131.
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 396192195844 + 916838805289 = 629438^2 + 957517^2 .
It is a cyclic number.
It is not a de Polignac number, because 1313031001133 - 216 = 1313030935597 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 (1313031001123) 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, 18091058 + ... + 18163491.
It is an arithmetic number, because the mean of its divisors is an integer number (328266822975).
Almost surely, 21313031001133 is an apocalyptic number.
It is an amenable number.
1313031001133 is a deficient number, since it is larger than the sum of its proper divisors (36290767).
1313031001133 is an equidigital number, since it uses as much as digits as its factorization.
1313031001133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36290766.
The product of its (nonzero) digits is 243, while the sum is 20.
Adding to 1313031001133 its reverse (3311001303131), we get a palindrome (4624032304264).
The spelling of 1313031001133 in words is "one trillion, three hundred thirteen billion, thirty-one million, one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •