Base | Representation |
---|---|
bin | 10000000000111… |
… | …10101110001001 |
3 | 100100210100201110 |
4 | 20000132232021 |
5 | 233342443221 |
6 | 21155240533 |
7 | 3220621122 |
oct | 1000365611 |
9 | 310710643 |
10 | 134343561 |
11 | 69919340 |
12 | 38ba9149 |
13 | 21aa9841 |
14 | 13bb1049 |
15 | bbda776 |
hex | 801eb89 |
134343561 has 8 divisors (see below), whose sum is σ = 195408864. Its totient is φ = 81420320.
The previous prime is 134343541. The next prime is 134343563. The reversal of 134343561 is 165343431.
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 134343561 - 29 = 134343049 is a prime.
It is not an unprimeable number, because it can be changed into a prime (134343563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2035476 + ... + 2035541.
It is an arithmetic number, because the mean of its divisors is an integer number (24426108).
Almost surely, 2134343561 is an apocalyptic number.
134343561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
134343561 is a deficient number, since it is larger than the sum of its proper divisors (61065303).
134343561 is a wasteful number, since it uses less digits than its factorization.
134343561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4071031.
The product of its digits is 12960, while the sum is 30.
The square root of 134343561 is about 11590.6669782200. Note that the first 3 decimals coincide. The cubic root of 134343561 is about 512.1599549566.
Adding to 134343561 its reverse (165343431), we get a palindrome (299686992).
The spelling of 134343561 in words is "one hundred thirty-four million, three hundred forty-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •