Base | Representation |
---|---|
bin | 1100011110111… |
… | …10011100101100 |
3 | 21022001100001220 |
4 | 12033132130230 |
5 | 203302021142 |
6 | 14220303340 |
7 | 2411051424 |
oct | 617363454 |
9 | 238040056 |
10 | 104720172 |
11 | 541258a7 |
12 | 2b0a1b50 |
13 | 189070cb |
14 | dc9d484 |
15 | 92d82ec |
hex | 63de72c |
104720172 has 48 divisors (see below), whose sum is σ = 260870400. Its totient is φ = 32598720.
The previous prime is 104720171. The next prime is 104720177. The reversal of 104720172 is 271027401.
It is not an unprimeable number, because it can be changed into a prime (104720171) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12954 + ... + 19422.
It is an arithmetic number, because the mean of its divisors is an integer number (5434800).
Almost surely, 2104720172 is an apocalyptic number.
104720172 is a gapful number since it is divisible by the number (12) 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 104720172, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130435200).
104720172 is an abundant number, since it is smaller than the sum of its proper divisors (156150228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104720172 is a wasteful number, since it uses less digits than its factorization.
104720172 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6566 (or 6564 counting only the distinct ones).
The product of its (nonzero) digits is 784, while the sum is 24.
The square root of 104720172 is about 10233.2874483228. The cubic root of 104720172 is about 471.3499322062.
Adding to 104720172 its reverse (271027401), we get a palindrome (375747573).
The spelling of 104720172 in words is "one hundred four million, seven hundred twenty thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •