Base | Representation |
---|---|
bin | 1100011000100011000… |
… | …1011100110110010000 |
3 | 202100010210000100010102 |
4 | 3012020301130312100 |
5 | 11441202000441341 |
6 | 241422441151532 |
7 | 21241044455543 |
oct | 3061061346620 |
9 | 670123010112 |
10 | 212748062096 |
11 | 82253809a09 |
12 | 35294a8b5a8 |
13 | 170a645039b |
14 | a4231c885a |
15 | 580270cc9b |
hex | 3188c5cd90 |
212748062096 has 90 divisors (see below), whose sum is σ = 443409306930. Its totient is φ = 98854148096.
The previous prime is 212748062083. The next prime is 212748062123. The reversal of 212748062096 is 690260847212.
It can be written as a sum of positive squares in 3 ways, for example, as 52936806400 + 159811255696 = 230080^2 + 399764^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 212748062096.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 295894025 + ... + 295894743.
It is an arithmetic number, because the mean of its divisors is an integer number (4926770077).
Almost surely, 2212748062096 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 212748062096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (221704653465).
212748062096 is an abundant number, since it is smaller than the sum of its proper divisors (230661244834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212748062096 is an frugal number, since it uses more digits than its factorization.
212748062096 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1569 (or 827 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 47.
The spelling of 212748062096 in words is "two hundred twelve billion, seven hundred forty-eight million, sixty-two thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •