Base | Representation |
---|---|
bin | 10110100010011101… |
… | …01001011001101100 |
3 | 1011020021200110211022 |
4 | 23101032221121230 |
5 | 144240123243312 |
6 | 5320405313312 |
7 | 605566051655 |
oct | 132116513154 |
9 | 34207613738 |
10 | 12100212332 |
11 | 514a28868a |
12 | 2418405838 |
13 | 11aab50b70 |
14 | 82b06652c |
15 | 4ac468172 |
hex | 2d13a966c |
12100212332 has 48 divisors (see below), whose sum is σ = 24160463712. Its totient is φ = 5252981760.
The previous prime is 12100212331. The next prime is 12100212343. The reversal of 12100212332 is 23321200121.
12100212332 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 12100212332.
It is not an unprimeable number, because it can be changed into a prime (12100212331) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1960283 + ... + 1966445.
It is an arithmetic number, because the mean of its divisors is an integer number (503342994).
Almost surely, 212100212332 is an apocalyptic number.
It is an amenable number.
12100212332 is a deficient number, since it is larger than the sum of its proper divisors (12060251380).
12100212332 is a wasteful number, since it uses less digits than its factorization.
12100212332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8418 (or 8416 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 12100212332 its reverse (23321200121), we get a palindrome (35421412453).
The spelling of 12100212332 in words is "twelve billion, one hundred million, two hundred twelve thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •