Base | Representation |
---|---|
bin | 111101101000001001… |
… | …1100101110000000000 |
3 | 110122121021020101121000 |
4 | 1323100103211300000 |
5 | 4132020004041133 |
6 | 140444203132000 |
7 | 12363413603505 |
oct | 1732023456000 |
9 | 418537211530 |
10 | 132343815168 |
11 | 511436a7164 |
12 | 21795814000 |
13 | c63164ac06 |
14 | 65968a14ac |
15 | 36989dc413 |
hex | 1ed04e5c00 |
132343815168 has 528 divisors, whose sum is σ = 430275797280. Its totient is φ = 40043151360.
The previous prime is 132343815143. The next prime is 132343815169. The reversal of 132343815168 is 861518343231.
It is a happy number.
132343815168 is a `hidden beast` number, since 1 + 3 + 2 + 3 + 438 + 151 + 68 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132343815169) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 451685230 + ... + 451685522.
Almost surely, 2132343815168 is an apocalyptic number.
132343815168 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132343815168, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (215137898640).
132343815168 is an abundant number, since it is smaller than the sum of its proper divisors (297931982112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132343815168 is a wasteful number, since it uses less digits than its factorization.
132343815168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 401 (or 346 counting only the distinct ones).
The product of its digits is 414720, while the sum is 45.
The spelling of 132343815168 in words is "one hundred thirty-two billion, three hundred forty-three million, eight hundred fifteen thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •