Base | Representation |
---|---|
bin | 1100010010011100100… |
… | …0110110111101101100 |
3 | 202011220121202202011220 |
4 | 3010213020312331230 |
5 | 11424323131444322 |
6 | 240552124343340 |
7 | 21152334441363 |
oct | 3044710667554 |
9 | 664817682156 |
10 | 211110031212 |
11 | 81593122083 |
12 | 34ab83a4b50 |
13 | 16ba4c90142 |
14 | a3098347da |
15 | 57589ea55c |
hex | 3127236f6c |
211110031212 has 12 divisors (see below), whose sum is σ = 492590072856. Its totient is φ = 70370010400.
The previous prime is 211110031183. The next prime is 211110031213. The reversal of 211110031212 is 212130011112.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×2111100312122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211110031191 and 211110031200.
It is not an unprimeable number, because it can be changed into a prime (211110031213) 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, 8796251289 + ... + 8796251312.
It is an arithmetic number, because the mean of its divisors is an integer number (41049172738).
Almost surely, 2211110031212 is an apocalyptic number.
It is an amenable number.
211110031212 is an abundant number, since it is smaller than the sum of its proper divisors (281480041644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211110031212 is a wasteful number, since it uses less digits than its factorization.
211110031212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17592502608 (or 17592502606 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 211110031212 its reverse (212130011112), we get a palindrome (423240042324).
The spelling of 211110031212 in words is "two hundred eleven billion, one hundred ten million, thirty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •