Base | Representation |
---|---|
bin | 110001011111… |
… | …011001000000 |
3 | 220102010110220 |
4 | 301133121000 |
5 | 11310124012 |
6 | 1142023040 |
7 | 215163000 |
oct | 61373100 |
9 | 26363426 |
10 | 12973632 |
11 | 7361311 |
12 | 4417a80 |
13 | 28c3209 |
14 | 1a1a000 |
15 | 121408c |
hex | c5f640 |
12973632 has 112 divisors (see below), whose sum is σ = 40233600. Its totient is φ = 3687936.
The previous prime is 12973627. The next prime is 12973651. The reversal of 12973632 is 23637921.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (112).
It is a junction number, because it is equal to n+sod(n) for n = 12973593 and 12973602.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 65758 + ... + 65954.
Almost surely, 212973632 is an apocalyptic number.
12973632 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 12973632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20116800).
12973632 is an abundant number, since it is smaller than the sum of its proper divisors (27259968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12973632 is an equidigital number, since it uses as much as digits as its factorization.
12973632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233 (or 209 counting only the distinct ones).
The product of its digits is 13608, while the sum is 33.
The square root of 12973632 is about 3601.8928357185. The cubic root of 12973632 is about 234.9743868267.
The spelling of 12973632 in words is "twelve million, nine hundred seventy-three thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •