Base | Representation |
---|---|
bin | 10011000011011010110… |
… | …010000111101101100101 |
3 | 11122011122012101121120021 |
4 | 103003122302013231211 |
5 | 132423012200123421 |
6 | 2441300333435141 |
7 | 163411452502405 |
oct | 23033262075545 |
9 | 4564565347507 |
10 | 1309340629861 |
11 | 465319718700 |
12 | 19191363bab1 |
13 | 966162cc964 |
14 | 4752dd0c805 |
15 | 240d3e89341 |
hex | 130dac87b65 |
1309340629861 has 12 divisors (see below), whose sum is σ = 1440577902400. Its totient is φ = 1189163919240.
The previous prime is 1309340629859. The next prime is 1309340629871. The reversal of 1309340629861 is 1689260439031.
It is a happy number.
It is not a de Polignac number, because 1309340629861 - 21 = 1309340629859 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1309340629799 and 1309340629808.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1309340629871) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5081691 + ... + 5333128.
Almost surely, 21309340629861 is an apocalyptic number.
1309340629861 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1309340629861 is a deficient number, since it is larger than the sum of its proper divisors (131237272539).
1309340629861 is a wasteful number, since it uses less digits than its factorization.
1309340629861 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10415880 (or 10415869 counting only the distinct ones).
The product of its (nonzero) digits is 1679616, while the sum is 52.
The spelling of 1309340629861 in words is "one trillion, three hundred nine billion, three hundred forty million, six hundred twenty-nine thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •