Base | Representation |
---|---|
bin | 110000110000… |
… | …011001100000 |
3 | 220001100110000 |
4 | 300300121200 |
5 | 11232444102 |
6 | 1133540000 |
7 | 213431556 |
oct | 60603140 |
9 | 26040400 |
10 | 12781152 |
11 | 723a73a |
12 | 4344600 |
13 | 2856717 |
14 | 19a9bd6 |
15 | 11c701c |
hex | c30660 |
12781152 has 60 divisors (see below), whose sum is σ = 37596636. Its totient is φ = 4259520.
The previous prime is 12781117. The next prime is 12781159. The reversal of 12781152 is 25118721.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a zygodrome in base 2 and base 3.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12781159) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 127 + ... + 5057.
Almost surely, 212781152 is an apocalyptic number.
12781152 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 12781152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18798318).
12781152 is an abundant number, since it is smaller than the sum of its proper divisors (24815484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12781152 is an equidigital number, since it uses as much as digits as its factorization.
12781152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4953 (or 4936 counting only the distinct ones).
The product of its digits is 1120, while the sum is 27.
The square root of 12781152 is about 3575.0737055339. The cubic root of 12781152 is about 233.8065462253.
Adding to 12781152 its reverse (25118721), we get a palindrome (37899873).
The spelling of 12781152 in words is "twelve million, seven hundred eighty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •