Base | Representation |
---|---|
bin | 11110100100101101011… |
… | …110101000010111000101 |
3 | 21102212001102221200102002 |
4 | 132210231132220113011 |
5 | 233410323003341401 |
6 | 4245104220355045 |
7 | 304535534304446 |
oct | 36445536502705 |
9 | 7385042850362 |
10 | 2101002012101 |
11 | 740036954463 |
12 | 29b2313a5a85 |
13 | 12317b836a85 |
14 | 73990a232cd |
15 | 399ba194a6b |
hex | 1e92d7a85c5 |
2101002012101 has 8 divisors (see below), whose sum is σ = 2235882706200. Its totient is φ = 1967376022528.
The previous prime is 2101002012049. The next prime is 2101002012107. The reversal of 2101002012101 is 1012102001012.
It can be written as a sum of positive squares in 4 ways, for example, as 1050840261025 + 1050161751076 = 1025105^2 + 1024774^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2101002012101 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 (2101002012107) 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, 313672676 + ... + 313679373.
It is an arithmetic number, because the mean of its divisors is an integer number (279485338275).
Almost surely, 22101002012101 is an apocalyptic number.
It is an amenable number.
2101002012101 is a deficient number, since it is larger than the sum of its proper divisors (134880694099).
2101002012101 is a wasteful number, since it uses less digits than its factorization.
2101002012101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 627352263.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2101002012101 its reverse (1012102001012), we get a palindrome (3113104013113).
The spelling of 2101002012101 in words is "two trillion, one hundred one billion, two million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •