Base | Representation |
---|---|
bin | 10110100111100111… |
… | …00011110101110000 |
3 | 1011100022000211120201 |
4 | 23103303203311300 |
5 | 144332210141222 |
6 | 5324552044544 |
7 | 606632364550 |
oct | 132363436560 |
9 | 34308024521 |
10 | 12143443312 |
11 | 5171725770 |
12 | 242a993754 |
13 | 11b6aa9220 |
14 | 832abb160 |
15 | 4b1157427 |
hex | 2d3ce3d70 |
12143443312 has 160 divisors (see below), whose sum is σ = 31906957824. Its totient is φ = 4323456000.
The previous prime is 12143443309. The next prime is 12143443313. The reversal of 12143443312 is 21334434121.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12143443313) 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 31 ways as a sum of consecutive naturals, for example, 1613863 + ... + 1621369.
Almost surely, 212143443312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12143443312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15953478912).
12143443312 is an abundant number, since it is smaller than the sum of its proper divisors (19763514512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12143443312 is a wasteful number, since it uses less digits than its factorization.
12143443312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7647 (or 7641 counting only the distinct ones).
The product of its digits is 6912, while the sum is 28.
Adding to 12143443312 its reverse (21334434121), we get a palindrome (33477877433).
The spelling of 12143443312 in words is "twelve billion, one hundred forty-three million, four hundred forty-three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •