Base | Representation |
---|---|
bin | 101110011011… |
… | …001011101000 |
3 | 211220022001021 |
4 | 232123023220 |
5 | 11103414320 |
6 | 1112502224 |
7 | 205304635 |
oct | 56331350 |
9 | 24808037 |
10 | 12169960 |
11 | 6962520 |
12 | 40aa974 |
13 | 26a147a |
14 | 188b18c |
15 | 1105daa |
hex | b9b2e8 |
12169960 has 64 divisors (see below), whose sum is σ = 31648320. Its totient is φ = 4162560.
The previous prime is 12169957. The next prime is 12169973. The reversal of 12169960 is 6996121.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is an unprimeable number.
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, 6667 + ... + 8293.
It is an arithmetic number, because the mean of its divisors is an integer number (494505).
Almost surely, 212169960 is an apocalyptic number.
12169960 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 12169960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15824160).
12169960 is an abundant number, since it is smaller than the sum of its proper divisors (19478360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12169960 is a wasteful number, since it uses less digits than its factorization.
12169960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1666 (or 1662 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 34.
The square root of 12169960 is about 3488.5469754613. The cubic root of 12169960 is about 230.0186500315.
The spelling of 12169960 in words is "twelve million, one hundred sixty-nine thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •