Base | Representation |
---|---|
bin | 110000000001100001100101… |
… | …001110010111010000110100 |
3 | 1000200211120112102211222210022 |
4 | 300001201211032113100310 |
5 | 210140440122030342322 |
6 | 2025112555401544312 |
7 | 62326330503151130 |
oct | 6001414516272064 |
9 | 1020746472758708 |
10 | 211211010012212 |
11 | 613310a498a601 |
12 | 1b832137aa5098 |
13 | 90b1160a23a12 |
14 | 3a2294b5d63c0 |
15 | 196413a588942 |
hex | c01865397434 |
211211010012212 has 24 divisors (see below), whose sum is σ = 424863765814656. Its totient is φ = 89995773050208.
The previous prime is 211211010012181. The next prime is 211211010012329. The reversal of 211211010012212 is 212210010112112.
It is a super-2 number, since 2×2112110100122122 (a number of 29 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 21801296768 + ... + 21801306455.
It is an arithmetic number, because the mean of its divisors is an integer number (17702656908944).
Almost surely, 2211211010012212 is an apocalyptic number.
It is an amenable number.
211211010012212 is an abundant number, since it is smaller than the sum of its proper divisors (213652755802444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211211010012212 is a wasteful number, since it uses less digits than its factorization.
211211010012212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43602603407 (or 43602603405 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 211211010012212 its reverse (212210010112112), we get a palindrome (423421020124324).
The spelling of 211211010012212 in words is "two hundred eleven trillion, two hundred eleven billion, ten million, twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •