Base | Representation |
---|---|
bin | 1100010110000101110… |
… | …0000001111110110101 |
3 | 202021102210020121011112 |
4 | 3011201130001332311 |
5 | 11433324030314410 |
6 | 241233144444405 |
7 | 21215512256603 |
oct | 3054134017665 |
9 | 667383217145 |
10 | 212088135605 |
11 | 81a45250415 |
12 | 3512ba79705 |
13 | 16ccc802138 |
14 | a39d6c2873 |
15 | 57b4804105 |
hex | 3161701fb5 |
212088135605 has 4 divisors (see below), whose sum is σ = 254505762732. Its totient is φ = 169670508480.
The previous prime is 212088135583. The next prime is 212088135629. The reversal of 212088135605 is 506531880212.
212088135605 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 77574504484 + 134513631121 = 278522^2 + 366761^2 .
It is not a de Polignac number, because 212088135605 - 216 = 212088070069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21208813556 + ... + 21208813565.
It is an arithmetic number, because the mean of its divisors is an integer number (63626440683).
Almost surely, 2212088135605 is an apocalyptic number.
It is an amenable number.
212088135605 is a deficient number, since it is larger than the sum of its proper divisors (42417627127).
212088135605 is an equidigital number, since it uses as much as digits as its factorization.
212088135605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42417627126.
The product of its (nonzero) digits is 115200, while the sum is 41.
The spelling of 212088135605 in words is "two hundred twelve billion, eighty-eight million, one hundred thirty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •