Base | Representation |
---|---|
bin | 110000001101001011101010… |
… | …100000010011001101110011 |
3 | 1000210200011022110210221201211 |
4 | 300031023222200103031303 |
5 | 210242101300130013021 |
6 | 2030525004014540551 |
7 | 62441240504541445 |
oct | 6015135240231563 |
9 | 1023604273727654 |
10 | 212012110001011 |
11 | 6160a915a51151 |
12 | 1b94144a807757 |
13 | 913b86b848c28 |
14 | 3a4d625a96495 |
15 | 1979dc520d3e1 |
hex | c0d2ea813373 |
212012110001011 has 4 divisors (see below), whose sum is σ = 212167886718024. Its totient is φ = 211856333284000.
The previous prime is 212012110001009. The next prime is 212012110001039. The reversal of 212012110001011 is 110100011210212.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 212012110001011 - 21 = 212012110001009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212012110000982 and 212012110001000.
It is not an unprimeable number, because it can be changed into a prime (212012110001411) 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, 77888356465 + ... + 77888359186.
It is an arithmetic number, because the mean of its divisors is an integer number (53041971679506).
Almost surely, 2212012110001011 is an apocalyptic number.
212012110001011 is a deficient number, since it is larger than the sum of its proper divisors (155776717013).
212012110001011 is a wasteful number, since it uses less digits than its factorization.
212012110001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 155776717012.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 212012110001011 its reverse (110100011210212), we get a palindrome (322112121211223).
The spelling of 212012110001011 in words is "two hundred twelve trillion, twelve billion, one hundred ten million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •