Base | Representation |
---|---|
bin | 11110000011010011110101… |
… | …111101011111111110001101 |
3 | 122022222012221010001200000202 |
4 | 132003103311331133332031 |
5 | 114310423311201002143 |
6 | 1145033311450303245 |
7 | 36560612365041506 |
oct | 3603236575377615 |
9 | 568865833050022 |
10 | 132168860172173 |
11 | 39127553a28710 |
12 | 129a7263a27b25 |
13 | 58996158895a6 |
14 | 248d015179bad |
15 | 1043036cbeab8 |
hex | 7834f5f5ff8d |
132168860172173 has 16 divisors (see below), whose sum is σ = 144765280598400. Its totient is φ = 119669491994880.
The previous prime is 132168860172163. The next prime is 132168860172191. The reversal of 132168860172173 is 371271068861231.
It is a cyclic number.
It is not a de Polignac number, because 132168860172173 - 28 = 132168860171917 is a prime.
It is a super-2 number, since 2×1321688601721732 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132168860172143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7574273 + ... + 17936201.
It is an arithmetic number, because the mean of its divisors is an integer number (9047830037400).
Almost surely, 2132168860172173 is an apocalyptic number.
It is an amenable number.
132168860172173 is a deficient number, since it is larger than the sum of its proper divisors (12596420426227).
132168860172173 is a wasteful number, since it uses less digits than its factorization.
132168860172173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10366612.
The product of its (nonzero) digits is 4064256, while the sum is 56.
The spelling of 132168860172173 in words is "one hundred thirty-two trillion, one hundred sixty-eight billion, eight hundred sixty million, one hundred seventy-two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •