Base | Representation |
---|---|
bin | 11110100100111001111… |
… | …111101111110110000101 |
3 | 21102212121002010012020011 |
4 | 132210321333233312011 |
5 | 233411240234120401 |
6 | 4245141121510221 |
7 | 304543664323615 |
oct | 36447177576605 |
9 | 7385532105204 |
10 | 2101212020101 |
11 | 740134452597 |
12 | 29b28b7a2371 |
13 | 1231b31b646c |
14 | 739b088ca45 |
15 | 399cd829451 |
hex | 1e939fefd85 |
2101212020101 has 8 divisors (see below), whose sum is σ = 2152503088344. Its totient is φ = 2049922951680.
The previous prime is 2101212020077. The next prime is 2101212020111. The reversal of 2101212020101 is 1010202121012.
It can be written as a sum of positive squares in 4 ways, for example, as 11177987076 + 2090034033025 = 105726^2 + 1445695^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2101212020101 - 233 = 2092622085509 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101212020111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1749075 + ... + 2694751.
It is an arithmetic number, because the mean of its divisors is an integer number (269062886043).
Almost surely, 22101212020101 is an apocalyptic number.
It is an amenable number.
2101212020101 is a deficient number, since it is larger than the sum of its proper divisors (51291068243).
2101212020101 is an equidigital number, since it uses as much as digits as its factorization.
2101212020101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 999911.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2101212020101 its reverse (1010202121012), we get a palindrome (3111414141113).
The spelling of 2101212020101 in words is "two trillion, one hundred one billion, two hundred twelve million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •