Base | Representation |
---|---|
bin | 11110000011010101010100… |
… | …100111110010100011001101 |
3 | 122022222101000210102202122111 |
4 | 132003111110213302203031 |
5 | 114310440034232112441 |
6 | 1145034133221544021 |
7 | 36560666631043321 |
oct | 3603252447624315 |
9 | 568871023382574 |
10 | 132170448316621 |
11 | 39128199442090 |
12 | 129a7627875011 |
13 | 5899809901030 |
14 | 248d126065981 |
15 | 10430cb42b081 |
hex | 7835549f28cd |
132170448316621 has 8 divisors (see below), whose sum is σ = 155277170050464. Its totient is φ = 110912264321520.
The previous prime is 132170448316607. The next prime is 132170448316637. The reversal of 132170448316621 is 126613844071231.
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 132170448316621 - 27 = 132170448316493 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132170448316601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 462134434531 + ... + 462134434816.
It is an arithmetic number, because the mean of its divisors is an integer number (19409646256308).
Almost surely, 2132170448316621 is an apocalyptic number.
132170448316621 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
132170448316621 is a deficient number, since it is larger than the sum of its proper divisors (23106721733843).
132170448316621 is a wasteful number, since it uses less digits than its factorization.
132170448316621 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 924268869371.
The product of its (nonzero) digits is 1161216, while the sum is 49.
The spelling of 132170448316621 in words is "one hundred thirty-two trillion, one hundred seventy billion, four hundred forty-eight million, three hundred sixteen thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •