Base | Representation |
---|---|
bin | 10110010110101001… |
… | …01100001001000000 |
3 | 1010222101020201200212 |
4 | 23023110230021000 |
5 | 144034242224440 |
6 | 5302505533252 |
7 | 603253643204 |
oct | 131324541100 |
9 | 33871221625 |
10 | 12001133120 |
11 | 50a9365a39 |
12 | 23ab1a4228 |
13 | 1193470502 |
14 | 81bc34b04 |
15 | 4a38e6465 |
hex | 2cb52c240 |
12001133120 has 28 divisors (see below), whose sum is σ = 28577699004. Its totient is φ = 4800453120.
The previous prime is 12001133101. The next prime is 12001133129. The reversal of 12001133120 is 2133110021.
It can be written as a sum of positive squares in 2 ways, for example, as 1561198144 + 10439934976 = 39512^2 + 102176^2 .
It is a junction number, because it is equal to n+sod(n) for n = 12001133095 and 12001133104.
It is not an unprimeable number, because it can be changed into a prime (12001133129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18751451 + ... + 18752090.
Almost surely, 212001133120 is an apocalyptic number.
12001133120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12001133120 is an abundant number, since it is smaller than the sum of its proper divisors (16576565884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12001133120 is an equidigital number, since it uses as much as digits as its factorization.
12001133120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37503558 (or 37503548 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 12001133120 its reverse (2133110021), we get a palindrome (14134243141).
The spelling of 12001133120 in words is "twelve billion, one million, one hundred thirty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •