Base | Representation |
---|---|
bin | 1001101100100100111100… |
… | …0000010100101001011111 |
3 | 1101202020000200120210001001 |
4 | 2123021033000110221133 |
5 | 2344134104141011221 |
6 | 34401443441531131 |
7 | 2150156165264425 |
oct | 233111700245137 |
9 | 41666020523031 |
10 | 10661434313311 |
11 | 34405417aa481 |
12 | 1242310943aa7 |
13 | 5c44a47469c2 |
14 | 28c03254b115 |
15 | 1374dd3d5391 |
hex | 9b24f014a5f |
10661434313311 has 8 divisors (see below), whose sum is σ = 10899667164960. Its totient is φ = 10424574562272.
The previous prime is 10661434313297. The next prime is 10661434313347. The reversal of 10661434313311 is 11331343416601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10661434313311 - 25 = 10661434313279 is a prime.
It is a super-2 number, since 2×106614343133112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10661434310311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 343259451 + ... + 343290508.
It is an arithmetic number, because the mean of its divisors is an integer number (1362458395620).
Almost surely, 210661434313311 is an apocalyptic number.
10661434313311 is a deficient number, since it is larger than the sum of its proper divisors (238232851649).
10661434313311 is an equidigital number, since it uses as much as digits as its factorization.
10661434313311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 686550305.
The product of its (nonzero) digits is 46656, while the sum is 37.
Adding to 10661434313311 its reverse (11331343416601), we get a palindrome (21992777729912).
The spelling of 10661434313311 in words is "ten trillion, six hundred sixty-one billion, four hundred thirty-four million, three hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •