Base | Representation |
---|---|
bin | 111011100111001… |
… | …1110100111000101 |
3 | 12011101212221221100 |
4 | 1313032132213011 |
5 | 13044033042401 |
6 | 530253010313 |
7 | 100366064034 |
oct | 16716364705 |
9 | 5141787840 |
10 | 2000284101 |
11 | 937121062 |
12 | 479a83999 |
13 | 25b54677a |
14 | 14d93071b |
15 | ba91bb86 |
hex | 7739e9c5 |
2000284101 has 12 divisors (see below), whose sum is σ = 2889693612. Its totient is φ = 1333340736.
The previous prime is 2000284067. The next prime is 2000284159. The reversal of 2000284101 is 1014820002.
It can be written as a sum of positive squares in 2 ways, for example, as 1324232100 + 676052001 = 36390^2 + 26001^2 .
It is not a de Polignac number, because 2000284101 - 218 = 2000021957 is a prime.
It is a super-2 number, since 2×20002841012 = 8002272969426756402, which contains 22 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 (2000284201) 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, 102415 + ... + 120371.
It is an arithmetic number, because the mean of its divisors is an integer number (240807801).
Almost surely, 22000284101 is an apocalyptic number.
It is an amenable number.
2000284101 is a deficient number, since it is larger than the sum of its proper divisors (889409511).
2000284101 is a wasteful number, since it uses less digits than its factorization.
2000284101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30340 (or 30337 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
The square root of 2000284101 is about 44724.5357829458. The cubic root of 2000284101 is about 1259.9807045420.
The spelling of 2000284101 in words is "two billion, two hundred eighty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •