Base | Representation |
---|---|
bin | 10110010110100011… |
… | …00101110111101000 |
3 | 1010222022201110200100 |
4 | 23023101211313220 |
5 | 144034040233000 |
6 | 5302440305400 |
7 | 603244021413 |
oct | 131321456750 |
9 | 33868643610 |
10 | 12000321000 |
11 | 50a8960868 |
12 | 23aaa72260 |
13 | 1193247975 |
14 | 81baa2b7a |
15 | 4a37d5a00 |
hex | 2cb465de8 |
12000321000 has 192 divisors, whose sum is σ = 41658486480. Its totient is φ = 3113510400.
The previous prime is 12000320993. The next prime is 12000321083. The reversal of 12000321000 is 12300021.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 366109956 + 11634211044 = 19134^2 + 107862^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 314982 + ... + 351018.
Almost surely, 212000321000 is an apocalyptic number.
12000321000 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 12000321000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20829243240).
12000321000 is an abundant number, since it is smaller than the sum of its proper divisors (29658165480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12000321000 is a wasteful number, since it uses less digits than its factorization.
12000321000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36101 (or 36084 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 12000321000 its reverse (12300021), we get a palindrome (12012621021).
The spelling of 12000321000 in words is "twelve billion, three hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •