Base | Representation |
---|---|
bin | 111110100111011… |
… | …0000101000100001 |
3 | 12102102102221021122 |
4 | 1331032300220201 |
5 | 13300330134332 |
6 | 544252102025 |
7 | 103031246201 |
oct | 17516605041 |
9 | 5372387248 |
10 | 2101021217 |
11 | 988a76379 |
12 | 4a7764915 |
13 | 276387929 |
14 | 15d074401 |
15 | c46b9c12 |
hex | 7d3b0a21 |
2101021217 has 2 divisors, whose sum is σ = 2101021218. Its totient is φ = 2101021216.
The previous prime is 2101021193. The next prime is 2101021243. The reversal of 2101021217 is 7121201012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1486179601 + 614841616 = 38551^2 + 24796^2 .
It is a cyclic number.
It is not a de Polignac number, because 2101021217 - 214 = 2101004833 is a prime.
It is a super-2 number, since 2×21010212172 = 8828580308568322178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2101021195 and 2101021204.
It is not a weakly prime, because it can be changed into another prime (2101021717) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050510608 + 1050510609.
It is an arithmetic number, because the mean of its divisors is an integer number (1050510609).
Almost surely, 22101021217 is an apocalyptic number.
It is an amenable number.
2101021217 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101021217 is an equidigital number, since it uses as much as digits as its factorization.
2101021217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 17.
The square root of 2101021217 is about 45836.8979862294. The cubic root of 2101021217 is about 1280.7867105886.
Adding to 2101021217 its reverse (7121201012), we get a palindrome (9222222229).
The spelling of 2101021217 in words is "two billion, one hundred one million, twenty-one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •