Base | Representation |
---|---|
bin | 1100000011111000111101… |
… | …1101001000101111001101 |
3 | 1201221201212212010220202220 |
4 | 3000332033131020233031 |
5 | 3214231432012310410 |
6 | 44112001135005553 |
7 | 2536034135112612 |
oct | 300761735105715 |
9 | 51851785126686 |
10 | 13260970822605 |
11 | 4252a45353390 |
12 | 15a20943698b9 |
13 | 7526728c71cc |
14 | 33bb978b0509 |
15 | 17ee356ca070 |
hex | c0f8f748bcd |
13260970822605 has 32 divisors (see below), whose sum is σ = 23525871355008. Its totient is φ = 6324158956800.
The previous prime is 13260970822601. The next prime is 13260970822613. The reversal of 13260970822605 is 50622807906231.
It is a happy number.
It is not a de Polignac number, because 13260970822605 - 22 = 13260970822601 is a prime.
It is a super-4 number, since 4×132609708226054 (a number of 54 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13260970822601) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 658756494 + ... + 658776623.
It is an arithmetic number, because the mean of its divisors is an integer number (735183479844).
Almost surely, 213260970822605 is an apocalyptic number.
13260970822605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13260970822605 is a deficient number, since it is larger than the sum of its proper divisors (10264900532403).
13260970822605 is a wasteful number, since it uses less digits than its factorization.
13260970822605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1317533197.
The product of its (nonzero) digits is 2177280, while the sum is 51.
The spelling of 13260970822605 in words is "thirteen trillion, two hundred sixty billion, nine hundred seventy million, eight hundred twenty-two thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.571 sec. • engine limits •