Base | Representation |
---|---|
bin | 10110011011101111… |
… | …11000010001101100 |
3 | 1011002100202010200221 |
4 | 23031313320101230 |
5 | 144131220143200 |
6 | 5311034501124 |
7 | 604313364640 |
oct | 131567702154 |
9 | 34070663627 |
10 | 12043912300 |
11 | 5120524632 |
12 | 24015947a4 |
13 | 119c29b034 |
14 | 8237acc20 |
15 | 4a754691a |
hex | 2cddf846c |
12043912300 has 144 divisors (see below), whose sum is σ = 31258888192. Its totient is φ = 3940876800.
The previous prime is 12043912297. The next prime is 12043912301. The reversal of 12043912300 is 321934021.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (12043912301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1580299 + ... + 1587901.
Almost surely, 212043912300 is an apocalyptic number.
12043912300 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 12043912300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15629444096).
12043912300 is an abundant number, since it is smaller than the sum of its proper divisors (19214975892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12043912300 is a wasteful number, since it uses less digits than its factorization.
12043912300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7728 (or 7721 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
The spelling of 12043912300 in words is "twelve billion, forty-three million, nine hundred twelve thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •