Base | Representation |
---|---|
bin | 110001101110… |
… | …001010111100 |
3 | 220112012112010 |
4 | 301232022330 |
5 | 11314043142 |
6 | 1143211220 |
7 | 215534334 |
oct | 61561274 |
9 | 26465463 |
10 | 13034172 |
11 | 73a2848 |
12 | 4446b10 |
13 | 2914938 |
14 | 1a340c4 |
15 | 1226e9c |
hex | c6e2bc |
13034172 has 48 divisors (see below), whose sum is σ = 32471712. Its totient is φ = 4055040.
The previous prime is 13034159. The next prime is 13034173. The reversal of 13034172 is 27143031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13034173) 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 15 ways as a sum of consecutive naturals, for example, 36748 + ... + 37100.
It is an arithmetic number, because the mean of its divisors is an integer number (676494).
Almost surely, 213034172 is an apocalyptic number.
13034172 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 13034172, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16235856).
13034172 is an abundant number, since it is smaller than the sum of its proper divisors (19437540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13034172 is a wasteful number, since it uses less digits than its factorization.
13034172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 558 (or 556 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 21.
The square root of 13034172 is about 3610.2869692034. The cubic root of 13034172 is about 235.3393136661.
The spelling of 13034172 in words is "thirteen million, thirty-four thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •