Base | Representation |
---|---|
bin | 111011100111000… |
… | …1101000101001110 |
3 | 12011101202022110010 |
4 | 1313032031011032 |
5 | 13044023243202 |
6 | 530251254050 |
7 | 100365344514 |
oct | 16716150516 |
9 | 5141668403 |
10 | 2000212302 |
11 | 937082120 |
12 | 479a4a326 |
13 | 25b51cb9a |
14 | 14d9124b4 |
15 | ba90576c |
hex | 7738d14e |
2000212302 has 32 divisors (see below), whose sum is σ = 4514590080. Its totient is φ = 585223520.
The previous prime is 2000212301. The next prime is 2000212303. The reversal of 2000212302 is 2032120002.
It is an interprime number because it is at equal distance from previous prime (2000212301) and next prime (2000212303).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000212301) 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 15 ways as a sum of consecutive naturals, for example, 520608 + ... + 524435.
It is an arithmetic number, because the mean of its divisors is an integer number (141080940).
Almost surely, 22000212302 is an apocalyptic number.
2000212302 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2000212302 is an abundant number, since it is smaller than the sum of its proper divisors (2514377778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000212302 is a wasteful number, since it uses less digits than its factorization.
2000212302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1045088.
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 2000212302 is about 44723.7330955277. The cubic root of 2000212302 is about 1259.9656289440.
Adding to 2000212302 its reverse (2032120002), we get a palindrome (4032332304).
The spelling of 2000212302 in words is "two billion, two hundred twelve thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •