Base | Representation |
---|---|
bin | 1100010010111001000… |
… | …1000000010011100101 |
3 | 202012012221202211112000 |
4 | 3010232101000103211 |
5 | 11430044234412031 |
6 | 241012035315513 |
7 | 21155316015300 |
oct | 3045621002345 |
9 | 665187684460 |
10 | 211229607141 |
11 | 81644674263 |
12 | 34b3044bb99 |
13 | 16bc3999027 |
14 | a31b67db37 |
15 | 576426a3e6 |
hex | 312e4404e5 |
211229607141 has 24 divisors (see below), whose sum is σ = 364023815040. Its totient is φ = 120702631896.
The previous prime is 211229607133. The next prime is 211229607143. The reversal of 211229607141 is 141706922112.
211229607141 is a `hidden beast` number, since 2 + 1 + 1 + 2 + 2 + 9 + 607 + 1 + 41 = 666.
It is not a de Polignac number, because 211229607141 - 23 = 211229607133 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 211229607096 and 211229607105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211229607143) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 79828461 + ... + 79831106.
It is an arithmetic number, because the mean of its divisors is an integer number (15167658960).
Almost surely, 2211229607141 is an apocalyptic number.
211229607141 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
211229607141 is a deficient number, since it is larger than the sum of its proper divisors (152794207899).
211229607141 is a wasteful number, since it uses less digits than its factorization.
211229607141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159659590 (or 159659577 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 36.
The spelling of 211229607141 in words is "two hundred eleven billion, two hundred twenty-nine million, six hundred seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •