Base | Representation |
---|---|
bin | 111011100110111… |
… | …1001000001010101 |
3 | 12011101121010201211 |
4 | 1313031321001111 |
5 | 13044013131013 |
6 | 530245421421 |
7 | 100364553121 |
oct | 16715710125 |
9 | 5141533654 |
10 | 2000130133 |
11 | 937026411 |
12 | 479a0a871 |
13 | 25b4c1671 |
14 | 14d8d0581 |
15 | ba8db23d |
hex | 77379055 |
2000130133 has 4 divisors (see below), whose sum is σ = 2105400160. Its totient is φ = 1894860108.
The previous prime is 2000130103. The next prime is 2000130157. The reversal of 2000130133 is 3310310002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2000130133 - 217 = 1999999061 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 (2000130103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52634985 + ... + 52635022.
It is an arithmetic number, because the mean of its divisors is an integer number (526350040).
Almost surely, 22000130133 is an apocalyptic number.
It is an amenable number.
2000130133 is a deficient number, since it is larger than the sum of its proper divisors (105270027).
2000130133 is a wasteful number, since it uses less digits than its factorization.
2000130133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105270026.
The product of its (nonzero) digits is 54, while the sum is 13.
The square root of 2000130133 is about 44722.8144575003. The cubic root of 2000130133 is about 1259.9483755199.
Adding to 2000130133 its reverse (3310310002), we get a palindrome (5310440135).
The spelling of 2000130133 in words is "two billion, one hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.088 sec. • engine limits •