Base | Representation |
---|---|
bin | 101111101100… |
… | …111111101100 |
3 | 212112022201200 |
4 | 233230333230 |
5 | 11200130233 |
6 | 1124005500 |
7 | 211201632 |
oct | 57547754 |
9 | 25468650 |
10 | 12505068 |
11 | 7071274 |
12 | 4230890 |
13 | 278ab64 |
14 | 1937352 |
15 | 1170313 |
hex | becfec |
12505068 has 36 divisors (see below), whose sum is σ = 32017440. Its totient is φ = 4114656.
The previous prime is 12505063. The next prime is 12505069. The reversal of 12505068 is 86050521.
It is a tau number, because it is divible by the number of its divisors (36).
It is not an unprimeable number, because it can be changed into a prime (12505063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 646 + ... + 5042.
Almost surely, 212505068 is an apocalyptic number.
12505068 is a gapful number since it is divisible by the number (18) 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 12505068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16008720).
12505068 is an abundant number, since it is smaller than the sum of its proper divisors (19512372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12505068 is a wasteful number, since it uses less digits than its factorization.
12505068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4486 (or 4481 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The square root of 12505068 is about 3536.2505567338. The cubic root of 12505068 is about 232.1108022057.
Adding to 12505068 its reverse (86050521), we get a palindrome (98555589).
The spelling of 12505068 in words is "twelve million, five hundred five thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •