Base | Representation |
---|---|
bin | 1100010110001011110… |
… | …0101010011001100101 |
3 | 202021111112220120021122 |
4 | 3011202330222121211 |
5 | 11433402021420411 |
6 | 241235451423325 |
7 | 21216240502163 |
oct | 3054274523145 |
9 | 667445816248 |
10 | 212113466981 |
11 | 81a58582239 |
12 | 35138454b45 |
13 | 17004b31110 |
14 | a3a2bd8233 |
15 | 57b6b599db |
hex | 3162f2a665 |
212113466981 has 16 divisors (see below), whose sum is σ = 231944832000. Its totient is φ = 192804530688.
The previous prime is 212113466969. The next prime is 212113467067. The reversal of 212113466981 is 189664311212.
212113466981 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 212113466981 - 210 = 212113465957 is a prime.
It is a super-2 number, since 2×2121134669812 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212113466921) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 171701 + ... + 673578.
It is an arithmetic number, because the mean of its divisors is an integer number (14496552000).
Almost surely, 2212113466981 is an apocalyptic number.
It is an amenable number.
212113466981 is a deficient number, since it is larger than the sum of its proper divisors (19831365019).
212113466981 is a wasteful number, since it uses less digits than its factorization.
212113466981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 845588.
The product of its digits is 124416, while the sum is 44.
The spelling of 212113466981 in words is "two hundred twelve billion, one hundred thirteen million, four hundred sixty-six thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •