Search a number
-
+
134505116553 = 3109141095361
BaseRepresentation
bin111110101000100100…
…0010011001110001001
3110212011220002212201110
41331101020103032021
54200431302212203
6141442451240533
712501106424643
oct1752110231611
9425156085643
10134505116553
11520526a4955
12220995a9149
13c8b7350182
14671d947893
153773612d03
hex1f51213389

134505116553 has 8 divisors (see below), whose sum is σ = 179504541216. Its totient is φ = 89587884800.

The previous prime is 134505116549. The next prime is 134505116563. The reversal of 134505116553 is 355611505431.

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

It is a cyclic number.

It is not a de Polignac number, because 134505116553 - 22 = 134505116549 is a prime.

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

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

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

Almost surely, 2134505116553 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 41096455.

The product of its (nonzero) digits is 135000, while the sum is 39.

The spelling of 134505116553 in words is "one hundred thirty-four billion, five hundred five million, one hundred sixteen thousand, five hundred fifty-three".

Divisors: 1 3 1091 3273 41095361 123286083 44835038851 134505116553