Base | Representation |
---|---|
bin | 1100010010000101001… |
… | …1010010001110001001 |
3 | 202011122210111101012001 |
4 | 3010201103102032021 |
5 | 11424123044213001 |
6 | 240534305351001 |
7 | 21150035156512 |
oct | 3044123221611 |
9 | 664583441161 |
10 | 211012101001 |
11 | 81542914719 |
12 | 34a8b638461 |
13 | 16b8a8c2780 |
14 | a2da821a09 |
15 | 5750104001 |
hex | 31214d2389 |
211012101001 has 4 divisors (see below), whose sum is σ = 227243801092. Its totient is φ = 194780400912.
The previous prime is 211012100989. The next prime is 211012101073. The reversal of 211012101001 is 100101210112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 31443800976 + 179568300025 = 177324^2 + 423755^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211012101001 is a prime.
It is a super-2 number, since 2×2110121010012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211012101901) 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, 8115850026 + ... + 8115850051.
It is an arithmetic number, because the mean of its divisors is an integer number (56810950273).
Almost surely, 2211012101001 is an apocalyptic number.
It is an amenable number.
211012101001 is a deficient number, since it is larger than the sum of its proper divisors (16231700091).
211012101001 is a wasteful number, since it uses less digits than its factorization.
211012101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16231700090.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 211012101001 its reverse (100101210112), we get a palindrome (311113311113).
The spelling of 211012101001 in words is "two hundred eleven billion, twelve million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •