Base | Representation |
---|---|
bin | 10110010110111001… |
… | …01100101100010100 |
3 | 1010222112012101112212 |
4 | 23023130230230110 |
5 | 144040311420112 |
6 | 5303022532552 |
7 | 603310536014 |
oct | 131334545424 |
9 | 33875171485 |
10 | 12003232532 |
11 | 50aa56a295 |
12 | 23aba37158 |
13 | 1193a26c75 |
14 | 81c21dc44 |
15 | 4a3bad522 |
hex | 2cb72cb14 |
12003232532 has 12 divisors (see below), whose sum is σ = 21158983860. Its totient is φ = 5957808576.
The previous prime is 12003232511. The next prime is 12003232543. The reversal of 12003232532 is 23523230021.
12003232532 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 3456969616 + 8546262916 = 58796^2 + 92446^2 .
It is a junction number, because it is equal to n+sod(n) for n = 12003232498 and 12003232507.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10951307 + ... + 10952402.
It is an arithmetic number, because the mean of its divisors is an integer number (1763248655).
Almost surely, 212003232532 is an apocalyptic number.
It is an amenable number.
12003232532 is a deficient number, since it is larger than the sum of its proper divisors (9155751328).
12003232532 is a wasteful number, since it uses less digits than its factorization.
12003232532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21903850 (or 21903848 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 23.
Adding to 12003232532 its reverse (23523230021), we get a palindrome (35526462553).
The spelling of 12003232532 in words is "twelve billion, three million, two hundred thirty-two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •