Base | Representation |
---|---|
bin | 110000010011011100010100… |
… | …000101011011110101011110 |
3 | 1000212012021201110100012212112 |
4 | 300103130110011123311132 |
5 | 210321123314402043402 |
6 | 2031454351452234022 |
7 | 62514310226162366 |
oct | 6023342405336536 |
9 | 1025167643305775 |
10 | 212442304331102 |
11 | 6176630348765a |
12 | 1b9b08a9a6b912 |
13 | 91702b989c981 |
14 | 3a6639600b9a6 |
15 | 19861a2819e52 |
hex | c1371415bd5e |
212442304331102 has 8 divisors (see below), whose sum is σ = 319797490150512. Its totient is φ = 105843140947600.
The previous prime is 212442304331083. The next prime is 212442304331107. The reversal of 212442304331102 is 201133403244212.
It is a happy number.
212442304331102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212442304331107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 189005608274 + ... + 189005609397.
It is an arithmetic number, because the mean of its divisors is an integer number (39974686268814).
Almost surely, 2212442304331102 is an apocalyptic number.
212442304331102 is a deficient number, since it is larger than the sum of its proper divisors (107355185819410).
212442304331102 is a wasteful number, since it uses less digits than its factorization.
212442304331102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 378011217954.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 212442304331102 its reverse (201133403244212), we get a palindrome (413575707575314).
The spelling of 212442304331102 in words is "two hundred twelve trillion, four hundred forty-two billion, three hundred four million, three hundred thirty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •