Base | Representation |
---|---|
bin | 1000001011100010… |
… | …1000111010000101 |
3 | 12200000221112220001 |
4 | 2002320220322011 |
5 | 13444121320301 |
6 | 1001521241301 |
7 | 105262502062 |
oct | 20270507205 |
9 | 5600845801 |
10 | 2195885701 |
11 | a2757a479 |
12 | 513493231 |
13 | 28cc20a69 |
14 | 16b8c9c69 |
15 | ccba7c01 |
hex | 82e28e85 |
2195885701 has 2 divisors, whose sum is σ = 2195885702. Its totient is φ = 2195885700.
The previous prime is 2195885641. The next prime is 2195885707. The reversal of 2195885701 is 1075885912.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1312250625 + 883635076 = 36225^2 + 29726^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2195885701 is a prime.
It is a super-3 number, since 3×21958857013 (a number of 29 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2195885707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1097942850 + 1097942851.
It is an arithmetic number, because the mean of its divisors is an integer number (1097942851).
Almost surely, 22195885701 is an apocalyptic number.
It is an amenable number.
2195885701 is a deficient number, since it is larger than the sum of its proper divisors (1).
2195885701 is an equidigital number, since it uses as much as digits as its factorization.
2195885701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 201600, while the sum is 46.
The square root of 2195885701 is about 46860.2784989590. The cubic root of 2195885701 is about 1299.7801799920.
The spelling of 2195885701 in words is "two billion, one hundred ninety-five million, eight hundred eighty-five thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •