Base | Representation |
---|---|
bin | 10111100010111011… |
… | …00110010110000000 |
3 | 1012121222021110222212 |
4 | 23301131212112000 |
5 | 201342044043010 |
6 | 5450204321252 |
7 | 625153515542 |
oct | 136135462600 |
9 | 35558243885 |
10 | 12641002880 |
11 | 53a7575620 |
12 | 2549543228 |
13 | 1265bb857c |
14 | 87cbd9692 |
15 | 4deb8c505 |
hex | 2f1766580 |
12641002880 has 128 divisors (see below), whose sum is σ = 33018550560. Its totient is φ = 4589568000.
The previous prime is 12641002877. The next prime is 12641002889. The reversal of 12641002880 is 8820014621.
It is a happy number.
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 (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12641002889) 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, 7017980 + ... + 7019780.
Almost surely, 212641002880 is an apocalyptic number.
12641002880 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 12641002880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16509275280).
12641002880 is an abundant number, since it is smaller than the sum of its proper divisors (20377547680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12641002880 is a wasteful number, since it uses less digits than its factorization.
12641002880 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2828 (or 2816 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 32.
The spelling of 12641002880 in words is "twelve billion, six hundred forty-one million, two thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •