Base | Representation |
---|---|
bin | 111110100111010… |
… | …1110001100010001 |
3 | 12102102102102120021 |
4 | 1331032232030101 |
5 | 13300324324332 |
6 | 544251543441 |
7 | 103031205064 |
oct | 17516561421 |
9 | 5372372507 |
10 | 2101011217 |
11 | 988a69908 |
12 | 4a775ab81 |
13 | 276383206 |
14 | 15d0708db |
15 | c46b6c97 |
hex | 7d3ae311 |
2101011217 has 2 divisors, whose sum is σ = 2101011218. Its totient is φ = 2101011216.
The previous prime is 2101011179. The next prime is 2101011277. The reversal of 2101011217 is 7121101012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2036626641 + 64384576 = 45129^2 + 8024^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2101011217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2101011217.
It is not a weakly prime, because it can be changed into another prime (2101011277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050505608 + 1050505609.
It is an arithmetic number, because the mean of its divisors is an integer number (1050505609).
Almost surely, 22101011217 is an apocalyptic number.
It is an amenable number.
2101011217 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101011217 is an equidigital number, since it uses as much as digits as its factorization.
2101011217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 16.
The square root of 2101011217 is about 45836.7889036743. The cubic root of 2101011217 is about 1280.7846785787.
Adding to 2101011217 its reverse (7121101012), we get a palindrome (9222112229).
The spelling of 2101011217 in words is "two billion, one hundred one million, eleven thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •