Base | Representation |
---|---|
bin | 110010011011… |
… | …100101001100 |
3 | 220212122200000 |
4 | 302123211030 |
5 | 11341021142 |
6 | 1151204300 |
7 | 220240530 |
oct | 62334514 |
9 | 26778600 |
10 | 13220172 |
11 | 750a569 |
12 | 4516690 |
13 | 297b4b4 |
14 | 1a81bc0 |
15 | 126214c |
hex | c9b94c |
13220172 has 144 divisors (see below), whose sum is σ = 41583360. Its totient is φ = 3592512.
The previous prime is 13220131. The next prime is 13220177. The reversal of 13220172 is 27102231.
13220172 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (13220177) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 197283 + ... + 197349.
Almost surely, 213220172 is an apocalyptic number.
13220172 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 13220172, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20791680).
13220172 is an abundant number, since it is smaller than the sum of its proper divisors (28363188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13220172 is a wasteful number, since it uses less digits than its factorization.
13220172 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122 (or 108 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 18.
The square root of 13220172 is about 3635.9554452716. The cubic root of 13220172 is about 236.4534754956.
The spelling of 13220172 in words is "thirteen million, two hundred twenty thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •