Base | Representation |
---|---|
bin | 1001101011100001011010… |
… | …1110110111010111101101 |
3 | 1101200111020121010201121212 |
4 | 2122320112232313113231 |
5 | 2343334444421444121 |
6 | 34345245210204205 |
7 | 2145645103135652 |
oct | 232702656672755 |
9 | 41614217121555 |
10 | 10643310343661 |
11 | 3433891244866 |
12 | 123a8b3123665 |
13 | 5c287692c6c8 |
14 | 28b1d348dc29 |
15 | 136ccc1e025b |
hex | 9ae16bb75ed |
10643310343661 has 4 divisors (see below), whose sum is σ = 10986642935424. Its totient is φ = 10299977751900.
The previous prime is 10643310343637. The next prime is 10643310343691. The reversal of 10643310343661 is 16634301334601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10643310343661 - 26 = 10643310343597 is a prime.
It is a super-2 number, since 2×106433103436612 (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 (10643310343691) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 171666295835 + ... + 171666295896.
It is an arithmetic number, because the mean of its divisors is an integer number (2746660733856).
Almost surely, 210643310343661 is an apocalyptic number.
It is an amenable number.
10643310343661 is a deficient number, since it is larger than the sum of its proper divisors (343332591763).
10643310343661 is an equidigital number, since it uses as much as digits as its factorization.
10643310343661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343332591762.
The product of its (nonzero) digits is 279936, while the sum is 41.
The spelling of 10643310343661 in words is "ten trillion, six hundred forty-three billion, three hundred ten million, three hundred forty-three thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •