Search a number
-
+
13120094673013 = 108712070004299
BaseRepresentation
bin1011111011101100001010…
…0101010001100001110101
31201110021020221211000201211
42332323002211101201311
53204424423214014023
643523142134121421
72522616114441406
oct276730245214165
951407227730654
1013120094673013
1141a9223448079
12157a9191b0271
137422b166c703
14335031b739ad
1517b43cadda0d
hexbeec2951875

13120094673013 has 4 divisors (see below), whose sum is σ = 13132164678400. Its totient is φ = 13108024667628.

The previous prime is 13120094672957. The next prime is 13120094673043. The reversal of 13120094673013 is 31037649002131.

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 13120094673013 - 221 = 13120092575861 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 213120094673013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 12070005386.

The product of its (nonzero) digits is 81648, while the sum is 40.

The spelling of 13120094673013 in words is "thirteen trillion, one hundred twenty billion, ninety-four million, six hundred seventy-three thousand, thirteen".

Divisors: 1 1087 12070004299 13120094673013