Base | Representation |
---|---|
bin | 111011100111010… |
… | …0101011011010110 |
3 | 12011101221101020110 |
4 | 1313032211123112 |
5 | 13044034441042 |
6 | 530253343450 |
7 | 100366241322 |
oct | 16716453326 |
9 | 5141841213 |
10 | 2000312022 |
11 | 937140035 |
12 | 479a97b86 |
13 | 25b5563a7 |
14 | 14d93a982 |
15 | ba92509c |
hex | 773a56d6 |
2000312022 has 8 divisors (see below), whose sum is σ = 4000624056. Its totient is φ = 666770672.
The previous prime is 2000312009. The next prime is 2000312029. The reversal of 2000312022 is 2202130002.
It is a sphenic number, since it is the product of 3 distinct primes.
2000312022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 2000311989 and 2000312007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000312029) 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 3 ways as a sum of consecutive naturals, for example, 166692663 + ... + 166692674.
It is an arithmetic number, because the mean of its divisors is an integer number (500078007).
Almost surely, 22000312022 is an apocalyptic number.
2000312022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000312022 is a wasteful number, since it uses less digits than its factorization.
2000312022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333385342.
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 2000312022 is about 44724.8479259572. The cubic root of 2000312022 is about 1259.9865670022.
Adding to 2000312022 its reverse (2202130002), we get a palindrome (4202442024).
The spelling of 2000312022 in words is "two billion, three hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •