Base | Representation |
---|---|
bin | 10111001011000110… |
… | …11010100111101100 |
3 | 1012010001022111112010 |
4 | 23211203122213230 |
5 | 200434421414012 |
6 | 5414310041220 |
7 | 620206315263 |
oct | 134543324754 |
9 | 35101274463 |
10 | 12441201132 |
11 | 5304808608 |
12 | 24b2649210 |
13 | 12336a0599 |
14 | 8604695da |
15 | 4cc371c3c |
hex | 2e58da9ec |
12441201132 has 48 divisors (see below), whose sum is σ = 29617412832. Its totient is φ = 4063288320.
The previous prime is 12441201127. The next prime is 12441201133. The reversal of 12441201132 is 23110214421.
It is a junction number, because it is equal to n+sod(n) for n = 12441201099 and 12441201108.
It is not an unprimeable number, because it can be changed into a prime (12441201133) 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 15 ways as a sum of consecutive naturals, for example, 468532 + ... + 494372.
It is an arithmetic number, because the mean of its divisors is an integer number (617029434).
Almost surely, 212441201132 is an apocalyptic number.
12441201132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12441201132 is an abundant number, since it is smaller than the sum of its proper divisors (17176211700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12441201132 is a wasteful number, since it uses less digits than its factorization.
12441201132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26658 (or 26656 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 12441201132 its reverse (23110214421), we get a palindrome (35551415553).
The spelling of 12441201132 in words is "twelve billion, four hundred forty-one million, two hundred one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •