Base | Representation |
---|---|
bin | 10000000010011… |
… | …11100010101100 |
3 | 100101011112000210 |
4 | 20001033202230 |
5 | 233420343112 |
6 | 21203422420 |
7 | 3222413124 |
oct | 1001174254 |
9 | 311145023 |
10 | 134543532 |
11 | 69a45602 |
12 | 39084a10 |
13 | 21b49876 |
14 | 13c23c84 |
15 | bc29b3c |
hex | 804f8ac |
134543532 has 12 divisors (see below), whose sum is σ = 313934936. Its totient is φ = 44847840.
The previous prime is 134543527. The next prime is 134543533. The reversal of 134543532 is 235345431.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 134543532.
It is not an unprimeable number, because it can be changed into a prime (134543533) 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 3 ways as a sum of consecutive naturals, for example, 5605969 + ... + 5605992.
Almost surely, 2134543532 is an apocalyptic number.
134543532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
134543532 is an abundant number, since it is smaller than the sum of its proper divisors (179391404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134543532 is a wasteful number, since it uses less digits than its factorization.
134543532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11211968 (or 11211966 counting only the distinct ones).
The product of its digits is 21600, while the sum is 30.
The square root of 134543532 is about 11599.2901506946. The cubic root of 134543532 is about 512.4139464479.
Adding to 134543532 its reverse (235345431), we get a palindrome (369888963).
The spelling of 134543532 in words is "one hundred thirty-four million, five hundred forty-three thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •