Base | Representation |
---|---|
bin | 10110100111010101… |
… | …10010000001011110 |
3 | 1011100010200220221000 |
4 | 23103222302001132 |
5 | 144331113021420 |
6 | 5324430451130 |
7 | 606604001526 |
oct | 132352620136 |
9 | 34303626830 |
10 | 12141142110 |
11 | 51703a3849 |
12 | 242a063aa6 |
13 | 11b6481976 |
14 | 83267c686 |
15 | 4b0d50690 |
hex | 2d3ab205e |
12141142110 has 64 divisors (see below), whose sum is σ = 34280884800. Its totient is φ = 3047187456.
The previous prime is 12141142067. The next prime is 12141142129. The reversal of 12141142110 is 1124114121.
12141142110 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 (18).
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 31 ways as a sum of consecutive naturals, for example, 1317975 + ... + 1327154.
It is an arithmetic number, because the mean of its divisors is an integer number (535638825).
Almost surely, 212141142110 is an apocalyptic number.
12141142110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12141142110 is an abundant number, since it is smaller than the sum of its proper divisors (22139742690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12141142110 is a wasteful number, since it uses less digits than its factorization.
12141142110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2645162 (or 2645156 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 12141142110 its reverse (1124114121), we get a palindrome (13265256231).
The spelling of 12141142110 in words is "twelve billion, one hundred forty-one million, one hundred forty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •