Base | Representation |
---|---|
bin | 110010101111… |
… | …010110110100 |
3 | 221000202210000 |
4 | 302233112310 |
5 | 11401114142 |
6 | 1153031300 |
7 | 221025633 |
oct | 62572664 |
9 | 27022700 |
10 | 13301172 |
11 | 7565405 |
12 | 4555530 |
13 | 29a9321 |
14 | 1aa351a |
15 | 127b14c |
hex | caf5b4 |
13301172 has 60 divisors (see below), whose sum is σ = 35394436. Its totient is φ = 4354560.
The previous prime is 13301143. The next prime is 13301177. The reversal of 13301172 is 27110331.
It can be written as a sum of positive squares in 2 ways, for example, as 1971216 + 11329956 = 1404^2 + 3366^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13301177) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 19428 + ... + 20100.
Almost surely, 213301172 is an apocalyptic number.
13301172 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 13301172, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17697218).
13301172 is an abundant number, since it is smaller than the sum of its proper divisors (22093264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13301172 is a wasteful number, since it uses less digits than its factorization.
13301172 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 750 (or 739 counting only the distinct ones).
The product of its (nonzero) digits is 126, while the sum is 18.
The square root of 13301172 is about 3647.0771859120. The cubic root of 13301172 is about 236.9354094134.
The spelling of 13301172 in words is "thirteen million, three hundred one thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •