Base | Representation |
---|---|
bin | 1001101011100000101100… |
… | …0100010001111101011001 |
3 | 1101200110201221212111022211 |
4 | 2122320023010101331121 |
5 | 2343334044321143001 |
6 | 34345213535315121 |
7 | 2145640205456056 |
oct | 232701304217531 |
9 | 41613657774284 |
10 | 10643114631001 |
11 | 34337a081aa66 |
12 | 123a85967baa1 |
13 | 5c28452169b8 |
14 | 28b1b54a602d |
15 | 136cb9e31351 |
hex | 9ae0b111f59 |
10643114631001 has 8 divisors (see below), whose sum is σ = 10679260161024. Its totient is φ = 10607012626320.
The previous prime is 10643114630957. The next prime is 10643114631011. The reversal of 10643114631001 is 10013641134601.
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 10643114631001 - 237 = 10505675677529 is a prime.
It is a super-2 number, since 2×106431146310012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10643114631011) 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, 10391415 + ... + 11369596.
It is an arithmetic number, because the mean of its divisors is an integer number (1334907520128).
Almost surely, 210643114631001 is an apocalyptic number.
It is an amenable number.
10643114631001 is a deficient number, since it is larger than the sum of its proper divisors (36145530023).
10643114631001 is a wasteful number, since it uses less digits than its factorization.
10643114631001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21762671.
The product of its (nonzero) digits is 5184, while the sum is 31.
Adding to 10643114631001 its reverse (10013641134601), we get a palindrome (20656755765602).
The spelling of 10643114631001 in words is "ten trillion, six hundred forty-three billion, one hundred fourteen million, six hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •