Base | Representation |
---|---|
bin | 110001101000… |
… | …111010000000 |
3 | 220111002221110 |
4 | 301220322000 |
5 | 11312400413 |
6 | 1142523320 |
7 | 215414430 |
oct | 61507200 |
9 | 26432843 |
10 | 13012608 |
11 | 7388624 |
12 | 4436540 |
13 | 2907b8b |
14 | 1a2a2c0 |
15 | 12208c3 |
hex | c68e80 |
13012608 has 128 divisors (see below), whose sum is σ = 40734720. Its totient is φ = 3603456.
The previous prime is 13012589. The next prime is 13012609. The reversal of 13012608 is 80621031.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13012609) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 126285 + ... + 126387.
It is an arithmetic number, because the mean of its divisors is an integer number (318240).
Almost surely, 213012608 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13012608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20367360).
13012608 is an abundant number, since it is smaller than the sum of its proper divisors (27722112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13012608 is a wasteful number, since it uses less digits than its factorization.
13012608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174 (or 162 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
The square root of 13012608 is about 3607.2992667645. The cubic root of 13012608 is about 235.2094586413.
Adding to 13012608 its reverse (80621031), we get a palindrome (93633639).
The spelling of 13012608 in words is "thirteen million, twelve thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •