Base | Representation |
---|---|
bin | 10100100001001… |
… | …00110000001000 |
3 | 102222212110010201 |
4 | 22100210300020 |
5 | 323030221000 |
6 | 25025021544 |
7 | 4156653556 |
oct | 1220446010 |
9 | 388773121 |
10 | 172117000 |
11 | 89179060 |
12 | 497848b4 |
13 | 29873aa3 |
14 | 18c04bd6 |
15 | 1019c96a |
hex | a424c08 |
172117000 has 64 divisors (see below), whose sum is σ = 439395840. Its totient is φ = 62584000.
The previous prime is 172116979. The next prime is 172117013. The reversal of 172117000 is 711271.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3177 + ... + 18823.
It is an arithmetic number, because the mean of its divisors is an integer number (6865560).
Almost surely, 2172117000 is an apocalyptic number.
172117000 is a gapful number since it is divisible by the number (10) 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 172117000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219697920).
172117000 is an abundant number, since it is smaller than the sum of its proper divisors (267278840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
172117000 is a wasteful number, since it uses less digits than its factorization.
172117000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15679 (or 15665 counting only the distinct ones).
The product of its (nonzero) digits is 98, while the sum is 19.
The square root of 172117000 is about 13119.3368734856. The cubic root of 172117000 is about 556.2558472642.
Adding to 172117000 its reverse (711271), we get a palindrome (172828271).
It can be divided in two parts, 1721 and 17000, that added together give a triangular number (18721 = T193).
The spelling of 172117000 in words is "one hundred seventy-two million, one hundred seventeen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •