Base | Representation |
---|---|
bin | 111101101110100… |
… | …0010100011101101 |
3 | 12100100100101021200 |
4 | 1323131002203231 |
5 | 13220212211341 |
6 | 541305120113 |
7 | 102216665523 |
oct | 17335024355 |
9 | 5310311250 |
10 | 2071210221 |
11 | 973164993 |
12 | 499789039 |
13 | 27014a9a2 |
14 | 159114313 |
15 | c1c7bdb6 |
hex | 7b7428ed |
2071210221 has 6 divisors (see below), whose sum is σ = 2991748110. Its totient is φ = 1380806808.
The previous prime is 2071210217. The next prime is 2071210231. The reversal of 2071210221 is 1220121702.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1486102500 + 585107721 = 38550^2 + 24189^2 .
It is not a de Polignac number, because 2071210221 - 22 = 2071210217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2071210194 and 2071210203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2071210231) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 115067226 + ... + 115067243.
It is an arithmetic number, because the mean of its divisors is an integer number (498624685).
Almost surely, 22071210221 is an apocalyptic number.
It is an amenable number.
2071210221 is a deficient number, since it is larger than the sum of its proper divisors (920537889).
2071210221 is a wasteful number, since it uses less digits than its factorization.
2071210221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 230134475 (or 230134472 counting only the distinct ones).
The product of its (nonzero) digits is 112, while the sum is 18.
The square root of 2071210221 is about 45510.5506558644. The cubic root of 2071210221 is about 1274.7002183320.
Adding to 2071210221 its reverse (1220121702), we get a palindrome (3291331923).
The spelling of 2071210221 in words is "two billion, seventy-one million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •