Base | Representation |
---|---|
bin | 11110100101101110111… |
… | …110111111001001101101 |
3 | 21102221220000220201100211 |
4 | 132211232332333021231 |
5 | 233420100324404401 |
6 | 4245405240022421 |
7 | 304605010540135 |
oct | 36455676771155 |
9 | 7387800821324 |
10 | 2102101013101 |
11 | 740550247151 |
12 | 29b499461a11 |
13 | 1232c5427b1b |
14 | 73a56981ac5 |
15 | 39a318ce951 |
hex | 1e96efbf26d |
2102101013101 has 4 divisors (see below), whose sum is σ = 2103982930972. Its totient is φ = 2100219095232.
The previous prime is 2102101013093. The next prime is 2102101013147. The reversal of 2102101013101 is 1013101012012.
It is a happy number.
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 42448360900 + 2059652652201 = 206030^2 + 1435149^2 .
It is a cyclic number.
It is not a de Polignac number, because 2102101013101 - 23 = 2102101013093 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 (2102101013161) 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, 940957260 + ... + 940959493.
It is an arithmetic number, because the mean of its divisors is an integer number (525995732743).
Almost surely, 22102101013101 is an apocalyptic number.
It is an amenable number.
2102101013101 is a deficient number, since it is larger than the sum of its proper divisors (1881917871).
2102101013101 is a wasteful number, since it uses less digits than its factorization.
2102101013101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1881917870.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 2102101013101 its reverse (1013101012012), we get a palindrome (3115202025113).
The spelling of 2102101013101 in words is "two trillion, one hundred two billion, one hundred one million, thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •