Base | Representation |
---|---|
bin | 111011101000111… |
… | …1110111110111101 |
3 | 12011110121122121120 |
4 | 1313101332332331 |
5 | 13044302000013 |
6 | 530324421153 |
7 | 100406642316 |
oct | 16721767675 |
9 | 5143548546 |
10 | 2001203133 |
11 | 937699596 |
12 | 47a2477b9 |
13 | 25b7a8b87 |
14 | 14dacd60d |
15 | baa4e123 |
hex | 7747efbd |
2001203133 has 8 divisors (see below), whose sum is σ = 2668497408. Its totient is φ = 1334022144.
The previous prime is 2001203119. The next prime is 2001203143. The reversal of 2001203133 is 3313021002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2001203133 - 24 = 2001203117 is a prime.
It is a super-3 number, since 3×20012031333 (a number of 29 digits) contains 333 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001203143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30141 + ... + 70077.
It is an arithmetic number, because the mean of its divisors is an integer number (333562176).
Almost surely, 22001203133 is an apocalyptic number.
It is an amenable number.
2001203133 is a deficient number, since it is larger than the sum of its proper divisors (667294275).
2001203133 is a wasteful number, since it uses less digits than its factorization.
2001203133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56643.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 2001203133 is about 44734.8089634906. The cubic root of 2001203133 is about 1260.1736413502.
Adding to 2001203133 its reverse (3313021002), we get a palindrome (5314224135).
The spelling of 2001203133 in words is "two billion, one million, two hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •