Base | Representation |
---|---|
bin | 1001101011100001011010… |
… | …1111000110101110100001 |
3 | 1101200111020121020220220111 |
4 | 2122320112233012232201 |
5 | 2343334444431002221 |
6 | 34345245211411321 |
7 | 2145645103520230 |
oct | 232702657065641 |
9 | 41614217226814 |
10 | 10643310406561 |
11 | 3433891288048 |
12 | 123a8b3153b41 |
13 | 5c2876952221 |
14 | 28b1d34a8b17 |
15 | 136ccc203be1 |
hex | 9ae16bc6ba1 |
10643310406561 has 8 divisors (see below), whose sum is σ = 12166823539584. Its totient is φ = 9120557328000.
The previous prime is 10643310406549. The next prime is 10643310406607. The reversal of 10643310406561 is 16560401334601.
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 10643310406561 - 211 = 10643310404513 is a prime.
It is a super-2 number, since 2×106433104065612 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10643310406541) 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 7 ways as a sum of consecutive naturals, for example, 189983605 + ... + 190039618.
It is an arithmetic number, because the mean of its divisors is an integer number (1520852942448).
Almost surely, 210643310406561 is an apocalyptic number.
It is an amenable number.
10643310406561 is a deficient number, since it is larger than the sum of its proper divisors (1523513133023).
10643310406561 is an equidigital number, since it uses as much as digits as its factorization.
10643310406561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380027231.
The product of its (nonzero) digits is 155520, while the sum is 40.
The spelling of 10643310406561 in words is "ten trillion, six hundred forty-three billion, three hundred ten million, four hundred six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •