Base | Representation |
---|---|
bin | 111110100111101… |
… | …1110111110001100 |
3 | 12102102210120122101 |
4 | 1331033132332030 |
5 | 13300402223040 |
6 | 544300124444 |
7 | 103032666436 |
oct | 17517367614 |
9 | 5372716571 |
10 | 2101211020 |
11 | 989095a37 |
12 | 4a7836724 |
13 | 27642313c |
14 | 15d0c3656 |
15 | c470609a |
hex | 7d3def8c |
2101211020 has 24 divisors (see below), whose sum is σ = 4422522384. Its totient is φ = 838583616.
The previous prime is 2101211017. The next prime is 2101211027. The reversal of 2101211020 is 201121012.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 2101210988 and 2101211006.
It is not an unprimeable number, because it can be changed into a prime (2101211027) 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, 109719 + ... + 127438.
It is an arithmetic number, because the mean of its divisors is an integer number (184271766).
Almost surely, 22101211020 is an apocalyptic number.
2101211020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2101211020 is an abundant number, since it is smaller than the sum of its proper divisors (2321311364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101211020 is a wasteful number, since it uses less digits than its factorization.
2101211020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237609 (or 237607 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 2101211020 is about 45838.9683566286. The cubic root of 2101211020 is about 1280.8252775226.
Adding to 2101211020 its reverse (201121012), we get a palindrome (2302332032).
The spelling of 2101211020 in words is "two billion, one hundred one million, two hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •