Base | Representation |
---|---|
bin | 10110010110100001… |
… | …10000101110100100 |
3 | 1010222022022102002120 |
4 | 23023100300232210 |
5 | 144034011301312 |
6 | 5302431505540 |
7 | 603242124000 |
oct | 131320605644 |
9 | 33868272076 |
10 | 12000103332 |
11 | 50a8822278 |
12 | 23aa9882b0 |
13 | 119319c879 |
14 | 81ba47700 |
15 | 4a379128c |
hex | 2cb430ba4 |
12000103332 has 96 divisors (see below), whose sum is σ = 33270048000. Its totient is φ = 3363849216.
The previous prime is 12000103289. The next prime is 12000103337. The reversal of 12000103332 is 23330100021.
It is not an unprimeable number, because it can be changed into a prime (12000103337) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 190644 + ... + 245652.
It is an arithmetic number, because the mean of its divisors is an integer number (346563000).
Almost surely, 212000103332 is an apocalyptic number.
12000103332 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 12000103332, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16635024000).
12000103332 is an abundant number, since it is smaller than the sum of its proper divisors (21269944668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12000103332 is a wasteful number, since it uses less digits than its factorization.
12000103332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55090 (or 55074 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 12000103332 its reverse (23330100021), we get a palindrome (35330203353).
The spelling of 12000103332 in words is "twelve billion, one hundred three thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •