Search a number
-
+
2631971643113 = 15831662647911
BaseRepresentation
bin100110010011001101101…
…111000001111011101001
3100022121120121222122201102
4212103031233001323221
5321110234220034423
65333035554331145
7361103465560421
oct46231557017351
910277517878642
102631971643113
1192523841702a
12366115b89ab5
13161269bb2ba7
1491560d75481
15486e4ad4c28
hex264cdbc1ee9

2631971643113 has 4 divisors (see below), whose sum is σ = 2633634292608. Its totient is φ = 2630308993620.

The previous prime is 2631971643043. The next prime is 2631971643149. The reversal of 2631971643113 is 3113461791362.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 2631971643113 - 220 = 2631970594537 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (2631971643193) 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, 831322373 + ... + 831325538.

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

Almost surely, 22631971643113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1662649494.

The product of its digits is 489888, while the sum is 47.

The spelling of 2631971643113 in words is "two trillion, six hundred thirty-one billion, nine hundred seventy-one million, six hundred forty-three thousand, one hundred thirteen".

Divisors: 1 1583 1662647911 2631971643113