Base | Representation |
---|---|
bin | 1100000110100111101000… |
… | …1001110010111000011001 |
3 | 1202010012220111202221000200 |
4 | 3001221322021302320121 |
5 | 3221013443131233230 |
6 | 44145313503252413 |
7 | 2542314062131155 |
oct | 301517211627031 |
9 | 52105814687020 |
10 | 13307858071065 |
11 | 4270915a450a8 |
12 | 15ab19a8aa109 |
13 | 756c057c5acc |
14 | 340164a48065 |
15 | 18127bb58160 |
hex | c1a7a272e19 |
13307858071065 has 48 divisors (see below), whose sum is σ = 23124662874768. Its totient is φ = 7079774035968.
The previous prime is 13307858071051. The next prime is 13307858071111. The reversal of 13307858071065 is 56017085870331.
13307858071065 is a `hidden beast` number, since 13 + 30 + 7 + 8 + 580 + 7 + 10 + 6 + 5 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 3322643587344 + 9985214483721 = 1822812^2 + 3159939^2 .
It is not a de Polignac number, because 13307858071065 - 27 = 13307858070937 is a prime.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 105877137 + ... + 106002753.
It is an arithmetic number, because the mean of its divisors is an integer number (481763809891).
Almost surely, 213307858071065 is an apocalyptic number.
13307858071065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13307858071065 is a deficient number, since it is larger than the sum of its proper divisors (9816804803703).
13307858071065 is a wasteful number, since it uses less digits than its factorization.
13307858071065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131498 (or 131495 counting only the distinct ones).
The product of its (nonzero) digits is 4233600, while the sum is 54.
The spelling of 13307858071065 in words is "thirteen trillion, three hundred seven billion, eight hundred fifty-eight million, seventy-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •