Search a number
-
+
134693632001 = 314344955871
BaseRepresentation
bin111110101110001011…
…1011011100000000001
3110212200000211110022002
41331130113123200001
54201323032211001
6141513303553345
712505555660445
oct1753427334001
9425600743262
10134693632001
115213a053345
122213075b855
13c917415c86
14673a9ba825
153784e4e46b
hex1f5c5db801

134693632001 has 4 divisors (see below), whose sum is σ = 139038587904. Its totient is φ = 130348676100.

The previous prime is 134693631983. The next prime is 134693632043. The reversal of 134693632001 is 100236396431.

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 134693632001 - 226 = 134626523137 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (134693632091) 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 3 ways as a sum of consecutive naturals, for example, 2172477905 + ... + 2172477966.

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

Almost surely, 2134693632001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4344955902.

The product of its (nonzero) digits is 69984, while the sum is 38.

The spelling of 134693632001 in words is "one hundred thirty-four billion, six hundred ninety-three million, six hundred thirty-two thousand, one".

Divisors: 1 31 4344955871 134693632001