Search a number
-
+
13872701031 = 374793137827
BaseRepresentation
bin11001110101110000…
…01001111001100111
31022210210221020012220
430322320021321213
5211402402413111
610212324043423
71000531004340
oct147270117147
938723836186
1013872701031
115979861682
122831b33573
13140112a947
1495861b0c7
15562d89e06
hex33ae09e67

13872701031 has 16 divisors (see below), whose sum is σ = 21143917824. Its totient is φ = 7925546304.

The previous prime is 13872701027. The next prime is 13872701033. The reversal of 13872701031 is 13010727831.

It is not a de Polignac number, because 13872701031 - 22 = 13872701027 is a prime.

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

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31740 + ... + 169566.

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

Almost surely, 213872701031 is an apocalyptic number.

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

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

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

The sum of its prime factors is 142630.

The product of its (nonzero) digits is 7056, while the sum is 33.

The spelling of 13872701031 in words is "thirteen billion, eight hundred seventy-two million, seven hundred one thousand, thirty-one".

Divisors: 1 3 7 21 4793 14379 33551 100653 137827 413481 964789 2894367 660604811 1981814433 4624233677 13872701031