Base | Representation |
---|---|
bin | 10111001000110011… |
… | …00101011011100000 |
3 | 1012001200220012022020 |
4 | 23210121211123200 |
5 | 200414443044002 |
6 | 5412335141440 |
7 | 616552645440 |
oct | 134431453340 |
9 | 35050805266 |
10 | 12421846752 |
11 | 52a4899357 |
12 | 24a8074880 |
13 | 122c684ca3 |
14 | 85ba6c120 |
15 | 4ca7ec2bc |
hex | 2e46656e0 |
12421846752 has 384 divisors, whose sum is σ = 40947379200. Its totient is φ = 3218227200.
The previous prime is 12421846741. The next prime is 12421846753. The reversal of 12421846752 is 25764812421.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12421846753) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 31932574 + ... + 31932962.
It is an arithmetic number, because the mean of its divisors is an integer number (106633800).
Almost surely, 212421846752 is an apocalyptic number.
12421846752 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 12421846752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20473689600).
12421846752 is an abundant number, since it is smaller than the sum of its proper divisors (28525532448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12421846752 is a wasteful number, since it uses less digits than its factorization.
12421846752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 530 (or 522 counting only the distinct ones).
The product of its digits is 215040, while the sum is 42.
The spelling of 12421846752 in words is "twelve billion, four hundred twenty-one million, eight hundred forty-six thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •