Base | Representation |
---|---|
bin | 10110010110100001… |
… | …11000000000000000 |
3 | 1010222022100220221211 |
4 | 23023100320000000 |
5 | 144034013224440 |
6 | 5302432255504 |
7 | 603242306563 |
oct | 131320700000 |
9 | 33868326854 |
10 | 12000133120 |
11 | 50a8842698 |
12 | 23aa9a1594 |
13 | 11931b02b1 |
14 | 81ba544da |
15 | 4a3799eea |
hex | 2cb438000 |
12000133120 has 64 divisors (see below), whose sum is σ = 28800273240. Its totient is φ = 4799987712.
The previous prime is 12000133087. The next prime is 12000133147. The reversal of 12000133120 is 2133100021.
It is a tau number, because it is divible by the number of its divisors (64).
It is a self number, because there is not a number n which added to its sum of digits gives 12000133120.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 127219 + ... + 200461.
Almost surely, 212000133120 is an apocalyptic number.
12000133120 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 12000133120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14400136620).
12000133120 is an abundant number, since it is smaller than the sum of its proper divisors (16800140120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12000133120 is an frugal number, since it uses more digits than its factorization.
12000133120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73278 (or 73250 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 12000133120 its reverse (2133100021), we get a palindrome (14133233141).
The spelling of 12000133120 in words is "twelve billion, one hundred thirty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •