Base | Representation |
---|---|
bin | 1100000110101100011111… |
… | …1101000011011010100000 |
3 | 1202010100021110220011021012 |
4 | 3001223013331003122200 |
5 | 3221024131304310020 |
6 | 44150051212120052 |
7 | 2542361321633111 |
oct | 301530775033240 |
9 | 52110243804235 |
10 | 13309163353760 |
11 | 427142582032a |
12 | 15ab4a3a66028 |
13 | 757083060431 |
14 | 34024a142208 |
15 | 18130653d7c5 |
hex | c1ac7f436a0 |
13309163353760 has 48 divisors (see below), whose sum is σ = 31443604123176. Its totient is φ = 5323545858048.
The previous prime is 13309163353669. The next prime is 13309163353777. The reversal of 13309163353760 is 6735336190331.
It can be written as a sum of positive squares in 4 ways, for example, as 13298479237264 + 10684116496 = 3646708^2 + 103364^2 .
It is a super-2 number, since 2×133091633537602 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13309163353699 and 13309163353708.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6397052 + ... + 8218308.
Almost surely, 213309163353760 is an apocalyptic number.
13309163353760 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13309163353760 is an abundant number, since it is smaller than the sum of its proper divisors (18134440769416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13309163353760 is a wasteful number, since it uses less digits than its factorization.
13309163353760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1866945 (or 1866937 counting only the distinct ones).
The product of its (nonzero) digits is 2755620, while the sum is 50.
The spelling of 13309163353760 in words is "thirteen trillion, three hundred nine billion, one hundred sixty-three million, three hundred fifty-three thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •