Search a number
-
+
13066740271 = 131795615273
BaseRepresentation
bin11000010101101011…
…01010001000101111
31020201122101011220101
430022311222020233
5203230041142041
610000333331531
7641543313454
oct141265521057
936648334811
1013066740271
1155a591a402
122648036ba7
13130316b8a0
148bd57d82b
15517236b31
hex30ad6a22f

13066740271 has 8 divisors (see below), whose sum is σ = 14150490480. Its totient is φ = 11994220992.

The previous prime is 13066740251. The next prime is 13066740301. The reversal of 13066740271 is 17204766031.

13066740271 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 13066740271 - 29 = 13066739759 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 13066740271.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2805310 + ... + 2809963.

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

Almost surely, 213066740271 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5615465.

The product of its (nonzero) digits is 42336, while the sum is 37.

The spelling of 13066740271 in words is "thirteen billion, sixty-six million, seven hundred forty thousand, two hundred seventy-one".

Divisors: 1 13 179 2327 5615273 72998549 1005133867 13066740271