Search a number
-
+
134950509652 = 2274819661059
BaseRepresentation
bin111110110101110101…
…1010101110001010100
3110220022221012012012011
41331223223111301110
54202334312302102
6141555001434004
712515125256050
oct1755353256124
9426287165164
10134950509652
1152261054322
12221a279b904
13c9586c5c9a
146762b66c60
15379c7912d7
hex1f6bad5c54

134950509652 has 12 divisors (see below), whose sum is σ = 269901019360. Its totient is φ = 57835932696.

The previous prime is 134950509623. The next prime is 134950509689. The reversal of 134950509652 is 256905059431.

134950509652 is an admirable number.

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

It is a junction number, because it is equal to n+sod(n) for n = 134950509596 and 134950509605.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2409830502 + ... + 2409830557.

Almost surely, 2134950509652 is an apocalyptic number.

It is an amenable number.

134950509652 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

134950509652 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 4819661070 (or 4819661068 counting only the distinct ones).

The product of its (nonzero) digits is 1458000, while the sum is 49.

The spelling of 134950509652 in words is "one hundred thirty-four billion, nine hundred fifty million, five hundred nine thousand, six hundred fifty-two".

Divisors: 1 2 4 7 14 28 4819661059 9639322118 19278644236 33737627413 67475254826 134950509652