Search a number
-
+
2064381655951 = 12823160990537
BaseRepresentation
bin11110000010100110101…
…111000011101110001111
321022100112022021211201001
4132002212233003232033
5232310323200442301
64220210331201131
7302101205356636
oct36024657035617
97270468254631
102064381655951
1172655469890a
122941112a61a7
1311c893a00a94
1471cb924451d
1538a75243c01
hex1e0a6bc3b8f

2064381655951 has 4 divisors (see below), whose sum is σ = 2064542659312. Its totient is φ = 2064220652592.

The previous prime is 2064381655939. The next prime is 2064381655997. The reversal of 2064381655951 is 1595561834602.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 2064381655951 - 211 = 2064381653903 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (2064381655451) by changing a digit.

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 3 ways as a sum of consecutive naturals, for example, 80482446 + ... + 80508091.

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

Almost surely, 22064381655951 is an apocalyptic number.

2064381655951 is a deficient number, since it is larger than the sum of its proper divisors (161003361).

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

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

The sum of its prime factors is 161003360.

The product of its (nonzero) digits is 7776000, while the sum is 55.

The spelling of 2064381655951 in words is "two trillion, sixty-four billion, three hundred eighty-one million, six hundred fifty-five thousand, nine hundred fifty-one".

Divisors: 1 12823 160990537 2064381655951