Base | Representation |
---|---|
bin | 111011100110111… |
… | …1001110010110101 |
3 | 12011101121022002011 |
4 | 1313031321302311 |
5 | 13044013231201 |
6 | 530245444221 |
7 | 100364565265 |
oct | 16715716265 |
9 | 5141538064 |
10 | 2000133301 |
11 | 937028831 |
12 | 479a10671 |
13 | 25b4c2c3a |
14 | 14d8d17a5 |
15 | ba8dc151 |
hex | 77379cb5 |
2000133301 has 4 divisors (see below), whose sum is σ = 2000229292. Its totient is φ = 2000037312.
The previous prime is 2000133259. The next prime is 2000133319. The reversal of 2000133301 is 1033310002.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 605110801 + 1395022500 = 24599^2 + 37350^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000133301 - 213 = 2000125109 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 (2000133341) 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, 2130 + ... + 63283.
It is an arithmetic number, because the mean of its divisors is an integer number (500057323).
Almost surely, 22000133301 is an apocalyptic number.
It is an amenable number.
2000133301 is a deficient number, since it is larger than the sum of its proper divisors (95991).
2000133301 is an equidigital number, since it uses as much as digits as its factorization.
2000133301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95990.
The product of its (nonzero) digits is 54, while the sum is 13.
The square root of 2000133301 is about 44722.8498756508. The cubic root of 2000133301 is about 1259.9490407290.
Adding to 2000133301 its reverse (1033310002), we get a palindrome (3033443303).
The spelling of 2000133301 in words is "two billion, one hundred thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •