Base | Representation |
---|---|
bin | 111110011100000… |
… | …0010000000110101 |
3 | 12102000020020021101 |
4 | 1330320002000311 |
5 | 13242314004333 |
6 | 543520250101 |
7 | 102626512444 |
oct | 17470020065 |
9 | 5360206241 |
10 | 2095063093 |
11 | 985676a02 |
12 | 4a5770931 |
13 | 27507ca06 |
14 | 15c362d5b |
15 | c3dde67d |
hex | 7ce02035 |
2095063093 has 2 divisors, whose sum is σ = 2095063094. Its totient is φ = 2095063092.
The previous prime is 2095063079. The next prime is 2095063151. The reversal of 2095063093 is 3903605902.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1728646929 + 366416164 = 41577^2 + 19142^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2095063093 is a prime.
It is a super-4 number, since 4×20950630934 (a number of 38 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2095063073) 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, 1047531546 + 1047531547.
It is an arithmetic number, because the mean of its divisors is an integer number (1047531547).
Almost surely, 22095063093 is an apocalyptic number.
It is an amenable number.
2095063093 is a deficient number, since it is larger than the sum of its proper divisors (1).
2095063093 is an equidigital number, since it uses as much as digits as its factorization.
2095063093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43740, while the sum is 37.
The square root of 2095063093 is about 45771.8591822530. The cubic root of 2095063093 is about 1279.5748695986.
Adding to 2095063093 its reverse (3903605902), we get a palindrome (5998668995).
The spelling of 2095063093 in words is "two billion, ninety-five million, sixty-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •