Base | Representation |
---|---|
bin | 1010011110000110110001… |
… | …1111110001010011010100 |
3 | 1111202120100020212110011010 |
4 | 2213201230133301103110 |
5 | 3002104224122333022 |
6 | 40252405333412220 |
7 | 2265511222462206 |
oct | 247415437612324 |
9 | 44676306773133 |
10 | 11512332621012 |
11 | 3739397703083 |
12 | 135b200a9a070 |
13 | 6567ba5b63c2 |
14 | 2bb2b263c776 |
15 | 14e6ded6250c |
hex | a786c7f14d4 |
11512332621012 has 48 divisors (see below), whose sum is σ = 27118573401920. Its totient is φ = 3800832532992.
The previous prime is 11512332621011. The next prime is 11512332621037. The reversal of 11512332621012 is 21012623321511.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11512332621011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1915068 + ... + 5166444.
Almost surely, 211512332621012 is an apocalyptic number.
11512332621012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11512332621012 is an abundant number, since it is smaller than the sum of its proper divisors (15606240780908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11512332621012 is a wasteful number, since it uses less digits than its factorization.
11512332621012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3254200 (or 3254198 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 30.
Adding to 11512332621012 its reverse (21012623321511), we get a palindrome (32524955942523).
The spelling of 11512332621012 in words is "eleven trillion, five hundred twelve billion, three hundred thirty-two million, six hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •