Base | Representation |
---|---|
bin | 10010111101001111100… |
… | …000101110001101110101 |
3 | 11121112112000221101210111 |
4 | 102331033200232031311 |
5 | 132320422010144121 |
6 | 2434242320223021 |
7 | 163055226244630 |
oct | 22751740561565 |
9 | 4545460841714 |
10 | 1302709068661 |
11 | 462526342610 |
12 | 19058276aa71 |
13 | 95aca437850 |
14 | 470a129cc17 |
15 | 23d46b9c2e1 |
hex | 12f4f82e375 |
1302709068661 has 32 divisors (see below), whose sum is σ = 1750367662848. Its totient is φ = 936330071040.
The previous prime is 1302709068637. The next prime is 1302709068707. The reversal of 1302709068661 is 1668609072031.
It is not a de Polignac number, because 1302709068661 - 213 = 1302709060469 is a prime.
It is a super-2 number, since 2×13027090686612 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1302709068361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 900445 + ... + 1848301.
It is an arithmetic number, because the mean of its divisors is an integer number (54698989464).
Almost surely, 21302709068661 is an apocalyptic number.
1302709068661 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1302709068661 is a deficient number, since it is larger than the sum of its proper divisors (447658594187).
1302709068661 is a wasteful number, since it uses less digits than its factorization.
1302709068661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 949261.
The product of its (nonzero) digits is 653184, while the sum is 49.
The spelling of 1302709068661 in words is "one trillion, three hundred two billion, seven hundred nine million, sixty-eight thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •