Search a number
-
+
13066575871001 = 25435138252407
BaseRepresentation
bin1011111000100100110010…
…0111001111110000011001
31201021011010010202012012112
42332021030213033300121
53203040321410333001
643442411352322105
72516012634226562
oct276111447176031
951234103665175
1013066575871001
11418855a485a94
1215704819a3335
1373a2328ac323
143325d5d8d169
15179d59375cbb
hexbe24c9cfc19

13066575871001 has 4 divisors (see below), whose sum is σ = 13071714125952. Its totient is φ = 13061437616052.

The previous prime is 13066575870989. The next prime is 13066575871033. The reversal of 13066575871001 is 10017857566031.

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 13066575871001 - 218 = 13066575608857 is a prime.

It is a Duffinian number.

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

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

Almost surely, 213066575871001 is an apocalyptic number.

It is an amenable number.

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

13066575871001 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 5138254950.

The product of its (nonzero) digits is 1058400, while the sum is 50.

The spelling of 13066575871001 in words is "thirteen trillion, sixty-six billion, five hundred seventy-five million, eight hundred seventy-one thousand, one".

Divisors: 1 2543 5138252407 13066575871001