Base | Representation |
---|---|
bin | 111011100111000… |
… | …1111001111001101 |
3 | 12011101202202120012 |
4 | 1313032033033031 |
5 | 13044024034013 |
6 | 530251403005 |
7 | 100365412331 |
oct | 16716171715 |
9 | 5141682505 |
10 | 2000221133 |
11 | 937088819 |
12 | 479a53465 |
13 | 25b523c01 |
14 | 14d9157c1 |
15 | ba9081a8 |
hex | 7738f3cd |
2000221133 has 4 divisors (see below), whose sum is σ = 2004397440. Its totient is φ = 1996044828.
The previous prime is 2000221117. The next prime is 2000221141. The reversal of 2000221133 is 3311220002.
It is a happy number.
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, and also an emirpimes, since its reverse is a distinct semiprime: 3311220002 = 2 ⋅1655610001.
It is a cyclic number.
It is not a de Polignac number, because 2000221133 - 24 = 2000221117 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 (2000221163) 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, 2087435 + ... + 2088392.
It is an arithmetic number, because the mean of its divisors is an integer number (501099360).
Almost surely, 22000221133 is an apocalyptic number.
It is an amenable number.
2000221133 is a deficient number, since it is larger than the sum of its proper divisors (4176307).
2000221133 is an equidigital number, since it uses as much as digits as its factorization.
2000221133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4176306.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 2000221133 is about 44723.8318237604. The cubic root of 2000221133 is about 1259.9674832038.
Adding to 2000221133 its reverse (3311220002), we get a palindrome (5311441135).
The spelling of 2000221133 in words is "two billion, two hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •