Base | Representation |
---|---|
bin | 1010011100111001100001… |
… | …0010111111000101110100 |
3 | 1111200120210211220202221201 |
4 | 2213032120102333011310 |
5 | 3001234240203140034 |
6 | 40235055331422244 |
7 | 2264145243456040 |
oct | 247163022770564 |
9 | 44616724822851 |
10 | 11491592630644 |
11 | 3730614500375 |
12 | 1357193154984 |
13 | 65486380a059 |
14 | 2ba2a5d6d020 |
15 | 14ddc9175014 |
hex | a73984bf174 |
11491592630644 has 48 divisors (see below), whose sum is σ = 23762771222400. Its totient is φ = 4759700814720.
The previous prime is 11491592630641. The next prime is 11491592630743. The reversal of 11491592630644 is 44603629519411.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11491592630641) 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, 37068022 + ... + 37376749.
It is an arithmetic number, because the mean of its divisors is an integer number (495057733800).
Almost surely, 211491592630644 is an apocalyptic number.
11491592630644 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11491592630644 is an abundant number, since it is smaller than the sum of its proper divisors (12271178591756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11491592630644 is a wasteful number, since it uses less digits than its factorization.
11491592630644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74444968 (or 74444966 counting only the distinct ones).
The product of its (nonzero) digits is 5598720, while the sum is 55.
The spelling of 11491592630644 in words is "eleven trillion, four hundred ninety-one billion, five hundred ninety-two million, six hundred thirty thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •