Base | Representation |
---|---|
bin | 1100010110100111101… |
… | …0000010110100111000 |
3 | 202021210200121021211201 |
4 | 3011221322002310320 |
5 | 11434121414033422 |
6 | 241255222103544 |
7 | 21222156054220 |
oct | 3055172026470 |
9 | 667720537751 |
10 | 212230221112 |
11 | 82008477358 |
12 | 3516b57abb4 |
13 | 1702308c7c0 |
14 | a3b450b080 |
15 | 57c201d727 |
hex | 3169e82d38 |
212230221112 has 64 divisors (see below), whose sum is σ = 490702968000. Its totient is φ = 83797908480.
The previous prime is 212230221109. The next prime is 212230221173. The reversal of 212230221112 is 211122032212.
It is a self number, because there is not a number n which added to its sum of digits gives 212230221112.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 99514 + ... + 659062.
It is an arithmetic number, because the mean of its divisors is an integer number (7667233875).
Almost surely, 2212230221112 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 212230221112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (245351484000).
212230221112 is an abundant number, since it is smaller than the sum of its proper divisors (278472746888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212230221112 is a wasteful number, since it uses less digits than its factorization.
212230221112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 560096 (or 560092 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 212230221112 its reverse (211122032212), we get a palindrome (423352253324).
The spelling of 212230221112 in words is "two hundred twelve billion, two hundred thirty million, two hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •