Base | Representation |
---|---|
bin | 10100100001011… |
… | …00010000000000 |
3 | 102222221000021012 |
4 | 22100230100000 |
5 | 323032211322 |
6 | 25025420052 |
7 | 4160142242 |
oct | 1220542000 |
9 | 388830235 |
10 | 172147712 |
11 | 8919a140 |
12 | 4979a628 |
13 | 29884a69 |
14 | 18c12092 |
15 | 101a6ae2 |
hex | a42c400 |
172147712 has 176 divisors, whose sum is σ = 424465920. Its totient is φ = 68812800.
The previous prime is 172147687. The next prime is 172147751. The reversal of 172147712 is 217741271.
It is a tau number, because it is divible by the number of its divisors (176).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5553137 + ... + 5553167.
Almost surely, 2172147712 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 172147712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (212232960).
172147712 is an abundant number, since it is smaller than the sum of its proper divisors (252318208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
172147712 is a wasteful number, since it uses less digits than its factorization.
172147712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108 (or 90 counting only the distinct ones).
The product of its digits is 5488, while the sum is 32.
The square root of 172147712 is about 13120.5073072652. The cubic root of 172147712 is about 556.2889307937.
Adding to 172147712 its reverse (217741271), we get a palindrome (389888983).
The spelling of 172147712 in words is "one hundred seventy-two million, one hundred forty-seven thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •