Base | Representation |
---|---|
bin | 10100100101001… |
… | …01001010011101 |
3 | 110000212011122012 |
4 | 22102211022131 |
5 | 323144033343 |
6 | 25044201005 |
7 | 4164304166 |
oct | 1222451235 |
9 | 400764565 |
10 | 172642973 |
11 | 894a8248 |
12 | 49999165 |
13 | 299c9309 |
14 | 18d0076d |
15 | 10253718 |
hex | a4a529d |
172642973 has 8 divisors (see below), whose sum is σ = 182918592. Its totient is φ = 162380736.
The previous prime is 172642957. The next prime is 172642997. The reversal of 172642973 is 379246271.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 172642973 - 24 = 172642957 is a prime.
It is a super-2 number, since 2×1726429732 = 59611192252557458, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 172642973.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (172642903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37736 + ... + 42062.
It is an arithmetic number, because the mean of its divisors is an integer number (22864824).
Almost surely, 2172642973 is an apocalyptic number.
It is an amenable number.
172642973 is a deficient number, since it is larger than the sum of its proper divisors (10275619).
172642973 is a wasteful number, since it uses less digits than its factorization.
172642973 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6691.
The product of its digits is 127008, while the sum is 41.
The square root of 172642973 is about 13139.3672983139. The cubic root of 172642973 is about 556.8218925204.
The spelling of 172642973 in words is "one hundred seventy-two million, six hundred forty-two thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •