Search a number
-
+
134343253069 = 2341142463683
BaseRepresentation
bin111110100011101111…
…0110101110001001101
3110211202121112100202121
41331013132311301031
54200113333044234
6141414430052541
712464102544514
oct1750736656115
9424677470677
10134343253069
1151a7a29a483
122205334a151
13c88c95946c
14670625167b
1537642dd4b4
hex1f477b5c4d

134343253069 has 8 divisors (see below), whose sum is σ = 143603393472. Its totient is φ = 125368040160.

The previous prime is 134343253063. The next prime is 134343253181. The reversal of 134343253069 is 960352343431.

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 134343253069 - 27 = 134343252941 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2134343253069 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 142463747.

The product of its (nonzero) digits is 699840, while the sum is 43.

The spelling of 134343253069 in words is "one hundred thirty-four billion, three hundred forty-three million, two hundred fifty-three thousand, sixty-nine".

Divisors: 1 23 41 943 142463683 3276664709 5841011003 134343253069