Base | Representation |
---|---|
bin | 10110100111010110… |
… | …00010111001110000 |
3 | 1011100010211102202200 |
4 | 23103223002321300 |
5 | 144331122224443 |
6 | 5324432143200 |
7 | 606604410225 |
oct | 132353027160 |
9 | 34303742680 |
10 | 12141211248 |
11 | 5170440791 |
12 | 242a097b00 |
13 | 11b64a728a |
14 | 83269994c |
15 | 4b0d65dd3 |
hex | 2d3ac2e70 |
12141211248 has 60 divisors (see below), whose sum is σ = 34296128568. Its totient is φ = 4009242240.
The previous prime is 12141211157. The next prime is 12141211259. The reversal of 12141211248 is 84211214121.
12141211248 is a `hidden beast` number, since 1 + 2 + 1 + 412 + 1 + 1 + 248 = 666.
12141211248 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a nude number because it is divisible by every one of its digits.
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 11 ways as a sum of consecutive naturals, for example, 378583 + ... + 409398.
Almost surely, 212141211248 is an apocalyptic number.
12141211248 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
12141211248 is an abundant number, since it is smaller than the sum of its proper divisors (22154917320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12141211248 is a wasteful number, since it uses less digits than its factorization.
12141211248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 788102 (or 788093 counting only the distinct ones).
The product of its digits is 1024, while the sum is 27.
Adding to 12141211248 its reverse (84211214121), we get a palindrome (96352425369).
The spelling of 12141211248 in words is "twelve billion, one hundred forty-one million, two hundred eleven thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •