Search a number
-
+
2095696868265 = 325711133614513
BaseRepresentation
bin11110011111110001010…
…001000111001110101001
321102100100201101110012100
4132133301101013032221
5233313441344241030
64242425545004013
7304260215315010
oct36376121071651
97370321343170
102095696868265
1173886427a370
1229a1b0783609
131228146c9000
147360a20da77
15397a9565360
hex1e7f14473a9

2095696868265 has 384 divisors, whose sum is σ = 4987650769920. Its totient is φ = 790589030400.

The previous prime is 2095696868233. The next prime is 2095696868281. The reversal of 2095696868265 is 5628686965902.

It is not a de Polignac number, because 2095696868265 - 25 = 2095696868233 is a prime.

It is a super-2 number, since 2×20956968682652 (a number of 25 digits) contains 22 as substring.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 2095696868193 and 2095696868202.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 464366649 + ... + 464371161.

It is an arithmetic number, because the mean of its divisors is an integer number (12988673880).

Almost surely, 22095696868265 is an apocalyptic number.

It is an amenable number.

2095696868265 is an abundant number, since it is smaller than the sum of its proper divisors (2891953901655).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

2095696868265 is a wasteful number, since it uses less digits than its factorization.

2095696868265 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 4642 (or 4613 counting only the distinct ones).

The product of its (nonzero) digits is 671846400, while the sum is 72.

The spelling of 2095696868265 in words is "two trillion, ninety-five billion, six hundred ninety-six million, eight hundred sixty-eight thousand, two hundred sixty-five".