Base | Representation |
---|---|
bin | 111110100111110… |
… | …0001001101100101 |
3 | 12102102211001020021 |
4 | 1331033201031211 |
5 | 13300403021242 |
6 | 544300235141 |
7 | 103033035256 |
oct | 17517411545 |
9 | 5372731207 |
10 | 2101220197 |
11 | 9890a191a |
12 | 4a783bab1 |
13 | 27642737b |
14 | 15d0c6b2d |
15 | c4708b67 |
hex | 7d3e1365 |
2101220197 has 4 divisors (see below), whose sum is σ = 2119815180. Its totient is φ = 2082625216.
The previous prime is 2101220183. The next prime is 2101220227. The reversal of 2101220197 is 7910221012.
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 1123657441 + 977562756 = 33521^2 + 31266^2 .
It is a cyclic number.
It is not a de Polignac number, because 2101220197 - 227 = 1967002469 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 (2101220167) 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, 9297322 + ... + 9297547.
It is an arithmetic number, because the mean of its divisors is an integer number (529953795).
Almost surely, 22101220197 is an apocalyptic number.
It is an amenable number.
2101220197 is a deficient number, since it is larger than the sum of its proper divisors (18594983).
2101220197 is a wasteful number, since it uses less digits than its factorization.
2101220197 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18594982.
The product of its (nonzero) digits is 504, while the sum is 25.
The square root of 2101220197 is about 45839.0684569397. The cubic root of 2101220197 is about 1280.8271421801.
It can be divided in two parts, 21012 and 20197, that added together give a square (41209 = 2032).
The spelling of 2101220197 in words is "two billion, one hundred one million, two hundred twenty thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •