Base | Representation |
---|---|
bin | 1010100010000101110101… |
… | …0100010000100110101101 |
3 | 1112000010001200110200212221 |
4 | 2220201131110100212231 |
5 | 3004214433120000442 |
6 | 40344051143555341 |
7 | 2303453645623036 |
oct | 250413524204655 |
9 | 45003050420787 |
10 | 11580797421997 |
11 | 3765430263431 |
12 | 137052975bb51 |
13 | 6600ab96626b |
14 | 2c07293cba8d |
15 | 15139a7c4467 |
hex | a885d5109ad |
11580797421997 has 24 divisors (see below), whose sum is σ = 12267268051968. Its totient is φ = 10921168792800.
The previous prime is 11580797421979. The next prime is 11580797422057. The reversal of 11580797421997 is 79912479708511.
It is a de Polignac number, because none of the positive numbers 2k-11580797421997 is a prime.
It is a super-2 number, since 2×115807974219972 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11580797421397) 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 23 ways as a sum of consecutive naturals, for example, 24470103 + ... + 24938875.
It is an arithmetic number, because the mean of its divisors is an integer number (511136168832).
Almost surely, 211580797421997 is an apocalyptic number.
It is an amenable number.
11580797421997 is a deficient number, since it is larger than the sum of its proper divisors (686470629971).
11580797421997 is an equidigital number, since it uses as much as digits as its factorization.
11580797421997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469321 (or 469278 counting only the distinct ones).
The product of its (nonzero) digits is 80015040, while the sum is 70.
The spelling of 11580797421997 in words is "eleven trillion, five hundred eighty billion, seven hundred ninety-seven million, four hundred twenty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •