Base | Representation |
---|---|
bin | 111011100111010… |
… | …0101101100101101 |
3 | 12011101221102202121 |
4 | 1313032211230231 |
5 | 13044040010013 |
6 | 530253352541 |
7 | 100366244500 |
oct | 16716455455 |
9 | 5141842677 |
10 | 2000313133 |
11 | 937140955 |
12 | 479a98751 |
13 | 25b556a50 |
14 | 14d93b137 |
15 | ba92558d |
hex | 773a5b2d |
2000313133 has 12 divisors (see below), whose sum is σ = 2505887580. Its totient is φ = 1582664832.
The previous prime is 2000313131. The next prime is 2000313163. The reversal of 2000313133 is 3313130002.
It can be written as a sum of positive squares in 2 ways, for example, as 1369148004 + 631165129 = 37002^2 + 25123^2 .
It is not a de Polignac number, because 2000313133 - 21 = 2000313131 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000313131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1569468 + ... + 1570741.
It is an arithmetic number, because the mean of its divisors is an integer number (208823965).
Almost surely, 22000313133 is an apocalyptic number.
It is an amenable number.
2000313133 is a deficient number, since it is larger than the sum of its proper divisors (505574447).
2000313133 is a wasteful number, since it uses less digits than its factorization.
2000313133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3140236 (or 3140229 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 16.
The square root of 2000313133 is about 44724.8603463443. The cubic root of 2000313133 is about 1259.9868002732.
Adding to 2000313133 its reverse (3313130002), we get a palindrome (5313443135).
The spelling of 2000313133 in words is "two billion, three hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •