Base | Representation |
---|---|
bin | 1100010101110000101… |
… | …1110100100011010100 |
3 | 202021012122101212010201 |
4 | 3011130023310203110 |
5 | 11433134000001322 |
6 | 241220315430244 |
7 | 21213362161240 |
oct | 3053413644324 |
9 | 667178355121 |
10 | 212000000212 |
11 | 819aa522a50 |
12 | 35106455384 |
13 | 16cb7483b10 |
14 | a391add420 |
15 | 57abbe4d27 |
hex | 315c2f48d4 |
212000000212 has 192 divisors, whose sum is σ = 534246451200. Its totient is φ = 70866731520.
The previous prime is 212000000207. The next prime is 212000000239.
212000000212 is nontrivially palindromic in base 10.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4005739 + ... + 4058317.
It is an arithmetic number, because the mean of its divisors is an integer number (2782533600).
Almost surely, 2212000000212 is an apocalyptic number.
212000000212 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 212000000212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (267123225600).
212000000212 is an abundant number, since it is smaller than the sum of its proper divisors (322246450988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212000000212 is a wasteful number, since it uses less digits than its factorization.
212000000212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52686 (or 52684 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
It can be divided in two parts, 212000000 and 212, that multiplied together give a square (44944000000 = 2120002).
The spelling of 212000000212 in words is "two hundred twelve billion, two hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.177 sec. • engine limits •